Results 21 to 30 of about 697,927 (279)
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
Syntactic Complexity of R- and J-Trivial Regular Languages [PDF]
, 2013 The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of ...
BAIYU LI +7 more
core +3 more sources
Regular omega-Languages with an Informative Right Congruence [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 A regular language is almost fully characterized by its right congruence relation. Indeed, a regular language can always be recognized by a DFA isomorphic to the automaton corresponding to its right congruence, henceforth the Rightcon automaton. The same
Dana Angluin, Dana Fisman
doaj +1 more source
On the Boundary of Regular Languages
Theoretical Computer Science, 2013 This paper considers the computation of the boundary of a regular language, defined as the intersection of the Kleene star of this language with the Kleene star of its complement. The precise state complexity of the boundary of a regular language is found.
Jozef Jirásek 0001, Galina Jirásková
openaire +2 more sources
From Regular to Strictly Locally Testable Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 A classical result (often credited to Y. Medvedev) states that every language recognized by a finite automaton is the homomorphic image of a local language, over a much larger so-called local alphabet, namely the alphabet of the edges of the transition ...
Stefano Crespi Reghizzi +1 more
doaj +1 more source
Most Complex Non-Returning Regular Languages [PDF]
, 2017 A regular language $L$ is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state.
B Krawetz +11 more
core +4 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
Kleene Algebras, Regular Languages and Substructural Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We introduce the two substructural propositional logics KL, KL+ , which use disjunction, fusion and a unary, (quasi-)exponential connective. For both we prove strong completeness with respect to the interpretation in Kleene algebras and a variant thereof.
Christian Wurm
doaj +1 more source
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
Varieties of Cost Functions. [PDF]
, 2016 Regular cost functions were introduced as a quantitative generalisation of regular languages, retaining many of their equivalent characterisations and decidability properties.
Daviaud, L., Kuperberg, D., Pin, J-E.
core +5 more sources