Results 21 to 30 of about 1,782,235 (292)
Separating Regular Languages with First-Order Logic [PDF]
Logical Methods in Computer Science, 2016 Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there exists a first ...
Thomas Place, Marc Zeitoun
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 +3 more sources
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
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
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
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
Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages [PDF]
, 2008 The spider diagram logic forms a fragment of the constraint diagram logic and was designed to be primarily used as a diagrammatic software specification tool.
Simon Thompson +5 more
core +1 more source
Beyond omega-regular languages: omegaT-regular expressions and their automata and logic counterparts [PDF]
, 2020 In the last years, some extensions of ω-regular languages, namely, ωB-regular (ω-regular languages extended with boundedness), ωS-regular (ω-regular languages extended with strong unboundedness), and ωBS-regular languages (the combination of ωB- and ωS ...
David Barozzini +9 more
core +1 more source
Learning Regular Languages over Large Ordered Alphabets [PDF]
Logical Methods in Computer Science, 2015 This work is concerned with regular languages defined over large alphabets, either infinite or just too large to be expressed enumeratively. We define a generic model where transitions are labeled by elements of a finite partition of the alphabet.
Irini-Eleftheria Mens, Oded Maler
doaj +1 more source
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