Results 31 to 40 of about 4,664,026 (360)
Decision trees for regular factorial languages
Array, 2022 In this paper, we study arbitrary regular factorial languages over a finite alphabet Σ. For the set of words L(n)of the length n belonging to a regular factorial language L, we investigate the depth of decision trees solving the recognition and the ...
Mikhail Moshkov
doaj +1 more source
Weakly and Strongly Irreversible Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted languages are called k-reversible automata and k-reversible languages ...
Giovanna J. Lavado +2 more
doaj +1 more source
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages [PDF]
Logical Methods in Computer Science, 2023 A classic result in formal language theory is the equivalence among non-counting, or aperiodic, regular languages, and languages defined through star-free regular expressions, or first-order logic.
Dino Mandrioli +2 more
doaj +1 more source
On the State Complexity of the Shuffle of Regular Languages [PDF]
Workshop on Descriptional Complexity of Formal Systems, 2015 We investigate the shuffle operation on regular languages represented by complete deterministic finite automata. We prove that $f(m,n)=2^{mn-1} + 2^{(m-1)(n-1)}(2^{m-1}-1)(2^{n-1}-1)$ is an upper bound on the state complexity of the shuffle of two ...
J. Brzozowski +4 more
semanticscholar +1 more source
Caterpillar dualities and regular languages [PDF]
, 2012 We characterize obstruction sets in caterpillar dualities in terms of regular languages, and give a construction of the dual of a regular family of caterpillars.
Erdős, Péter L. +2 more
core +2 more sources
Regular matching problems for infinite trees [PDF]
Logical Methods in Computer Science, 2022 We study the matching problem of regular tree languages, that is, "$\exists \sigma:\sigma(L)\subseteq R$?" where $L,R$ are regular tree languages over the union of finite ranked alphabets $\Sigma$ and $\mathcal{X}$ where $\mathcal{X}$ is an alphabet of ...
Carlos Camino +4 more
doaj +1 more source
Most Complex Regular Right-Ideal Languages [PDF]
, 2013 A right ideal is a language L over an alphabet A that satisfies L = LA*. We show that there exists a stream (sequence) (R_n : n \ge 3) of regular right ideal languages, where R_n has n left quotients and is most complex under the following measures of ...
J. Bell +9 more
core +3 more sources
Extracting Subregular constraints from Regular stringsets
Journal of Language Modelling, 2019 We introduce algorithms that, given a Finite-State Automaton (FSA), compute a minimal set of forbidden local factors that define a Strictly Local (SL) tight approximation of the stringset recognised by the FSA and the set of forbidden piecewise factors ...
James Rogers, Dakotah Lambert
doaj +1 more source
Nondeterministic State Complexity for Suffix-Free Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We investigate the nondeterministic state complexity of basic operations for suffix-free regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worst-case for a minimal ...
Yo-Sub Han, Kai Salomaa
doaj +1 more source
On the Structure and Complexity of Rational Sets of Regular Languages [PDF]
, 2013 In a recent thread of papers, we have introduced FQL, a precise specification language for test coverage, and developed the test case generation engine FShell for ANSI C.
Holzer, Andreas +3 more
core +2 more sources