Results 11 to 20 of about 4,664,026 (360)
Logic Meets Algebra: the Case of Regular Languages [PDF]
Logical Methods in Computer Science, 2007 The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e.
Pascal Tesson, Denis Therien
doaj +4 more sources
Syntactic Complexity of R- and J-Trivial Regular Languages [PDF]
International Journal of Foundations of Computer Science, 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 +4 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 +3 more sources
Efficient Algorithms for Morphisms over Omega-Regular Languages [PDF]
, 2015 Morphisms to finite semigroups can be used for recognizing omega-regular languages. The so-called strongly recognizing morphisms can be seen as a deterministic computation model which provides minimal objects (known as the syntactic morphism) and a ...
Fleischer, Lukas, Kufleitner, Manfred
core +5 more sources
Families of DFAs as Acceptors of $\omega$-Regular Languages [PDF]
Logical Methods in Computer Science, 2018 Families of DFAs (FDFAs) provide an alternative formalism for recognizing $\omega$-regular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to the ...
Dana Angluin, Udi Boker, Dana Fisman
doaj +3 more sources
Separation Property for wB- and wS-regular Languages [PDF]
Logical Methods in Computer Science, 2014 In this paper we show that {\omega}B- and {\omega}S-regular languages satisfy the following separation-type theorem If L1,L2 are disjoint languages of {\omega}-words both recognised by {\omega}B- (resp.
Michał Skrzypczak
doaj +3 more sources
Regular Languages meet Prefix Sorting
ACM-SIAM Symposium on Discrete Algorithms, 2019 Indexing strings via prefix (or suffix) sorting is, arguably, one of the most successful algorithmic techniques developed in the last decades. Can indexing be extended to languages?
Alanko, Jarno +3 more
core +2 more sources
Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA.
Paola Bonizzoni +2 more
doaj +4 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 +3 more sources
Commutative Languages and their Composition by Consensual Methods [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Commutative languages with the semilinear property (SLIP) can be naturally recognized by real-time NLOG-SPACE multi-counter machines. We show that unions and concatenations of such languages can be similarly recognized, relying on – and further ...
Stefano Crespi Reghizzi +1 more
doaj +6 more sources