Results 31 to 40 of about 2,934 (199)
Regular tree languages in low levels of the Wadge Hierarchy [PDF]
Logical Methods in Computer Science, 2019 In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidability for each of the finite levels of the hierarchy; for the class of the ...
Mikołaj Bojańczyk +3 more
doaj +1 more source
Regular Languages in the Sliding Window Model [PDF]
TheoretiCSWe study the space complexity of the following problem: For a fixed regular language $L$, we receive a stream of symbols and want to test membership of a sliding window of size $n$ in $L$.
Moses Ganardi +4 more
doaj +1 more source
Computing the Width of Non-deterministic Automata [PDF]
Logical Methods in Computer Science, 2019 We introduce a measure called width, quantifying the amount of nondeterminism in automata. Width generalises the notion of good-for-games (GFG) automata, that correspond to NFAs of width 1, and where an accepting run can be built on-the-fly on any ...
Denis Kuperberg, Anirban Majumdar
doaj +1 more source
Completing the picture for the Skolem Problem on order-4 linear recurrence sequences [PDF]
TheoretiCSFor almost a century, the decidability of the Skolem Problem - that is, the problem of finding whether a given linear recurrence sequence (LRS) has a zero term - has remained open. A breakthrough in the 1980s established that the Skolem Problem is indeed
Piotr Bacik
doaj +1 more source
FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems [PDF]
Logical Methods in Computer Science, 2016 A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO2(
Florent Jacquemard +2 more
doaj +1 more source
Formal Languages and Finite Automata. Guide for practical lessons [PDF]
, 2022 Fişierul ataşat conţine: Contents, References. Textul integral al publicaţiei poate fi accesat pe site-ul http://library.utm.md. Accesul prin logare este valabil pentru studenţi, masteranzi, doctoranzi şi cadre didactice UTM.This guide is intended for ...
COJUHARI, Irina +2 more
core +1 more source
Complexity of Problems of Commutative Grammars [PDF]
Logical Methods in Computer Science, 2015 We consider commutative regular and context-free grammars, or, in other words, Parikh images of regular and context-free languages. By using linear algebra and a branching analog of the classic Euler theorem, we show that, under an assumption that the ...
Eryk Kopczynski
doaj +1 more source
On the expressiveness of spider diagrams and commutative star-free regular languages [PDF]
, 2013 Spider diagrams provide a visual logic to express relations between sets and their elements, extending the expressiveness of Venn diagrams. Sound and complete inference systems for spider diagrams have been developed and it is known that they are ...
Taylor, John +3 more
core +1 more source
Sublinearly space bounded iterative arrays [PDF]
, 2007 Iterative arrays (IAs) are a, parallel computational model with a sequential processing of the input. They are one-dimensional arrays of interacting identical deterministic finite automata.
B.S. Palano +5 more
core
Spatial heterogeneity of hotspot mutations and clonal relatedness in ovarian endometrioid carcinoma
Molecular Oncology, EarlyView.Spatially resolved analysis revealed heterogeneous distributions of selected cancer‐associated mutations within ovarian endometrioid carcinomas. Shared mutations between paired endometrial and ovarian tumors supported clonal relatedness. These findings highlight the value of sampling multiple tumor regions when interpreting molecular profiles ...
Takahito Ashihara +10 more
wiley +1 more source