Results 11 to 20 of about 4,638,570 (374)
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.
Maler, Oded, Mens, Irini-Eleftheria
core +4 more sources
Caterpillar dualities and regular languages [PDF]
SIAM Journal on Discrete Mathematics, 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 +6 more sources
Regular Languages of Thin Trees [PDF]
Theory of Computing Systems, 2015 An infinite tree is called thin if it contains only countably many infinite branches. Thin trees can be seen as intermediate structures between infinite words and infinite trees. In this work we investigate properties of regular languages of thin trees. Our main tool is an algebra suitable for thin trees. Using this framework we characterize various
Bojanczyk, Mikolaj +2 more
openaire +6 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
Algebraic recognizability of regular tree languages [PDF]
, 2005 We propose a new algebraic framework to discuss and classify recognizable tree languages, and to characterize interesting classes of such languages. Our algebraic tool, called preclones, encompasses the classical notion of syntactic Sigma-algebra or ...
Esik, Zoltan, Weil, Pascal
core +5 more sources
On the Hierarchy of Block Deterministic Languages [PDF]
arXiv, 2015 A regular language is $k$-lookahead deterministic (resp. $k$-block deterministic) if it is specified by a $k$-lookahead deterministic (resp. $k$-block deterministic) regular expression.
A Brüggemann-Klein +9 more
core +3 more sources
Separating regular languages with two quantifier alternations [PDF]
Logical Methods in Computer Science, 2018 We investigate a famous decision problem in automata theory: separation. Given a class of language C, the separation problem for C takes as input two regular languages and asks whether there exists a third one which belongs to C, includes the first one ...
Place, Thomas
core +2 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
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
Syntactic Complexity of Prefix-, Suffix-, Bifix-, and Factor-Free Regular Languages [PDF]
arXiv, 2011 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 ...
Brzozowski, Janusz, Li, Baiyu, Ye, Yuli
core +3 more sources