Characterizations of some classes of regular events
From MaRDI portal
Publication:1083210
DOI10.1016/0304-3975(85)90003-9zbMath0604.68066OpenAlexW2032250117MaRDI QIDQ1083210
Publication date: 1985
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(85)90003-9
Related Items
Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words ⋮ Efficient algorithms for membership in Boolean hierarchies of regular languages ⋮ Polynomial closure and unambiguous product ⋮ On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs ⋮ The Boolean Algebra of Piecewise Testable Languages ⋮ Polynomial closure and unambiguous product ⋮ On Upper and Lower Bounds on the Length of Alternating Towers ⋮ Unnamed Item ⋮ Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words ⋮ Separability by piecewise testable languages is \textsc{PTime}-complete ⋮ Unnamed Item ⋮ Piecewise testable languages via combinatorics on words ⋮ Hierarchies of Piecewise Testable Languages ⋮ The product of rational languages ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups ⋮ Injective envelopes of transition systems and Ferrers languages ⋮ Hierarchies and reducibilities on regular languages related to modulo counting ⋮ LANGUAGES VERSUS ω-LANGUAGES IN REGULAR INFINITE GAMES ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Theme and Variations on the Concatenation Product ⋮ REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT ⋮ HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES ⋮ On Shuffle Ideals ⋮ On the height of towers of subsequences and prefixes ⋮ The pseudovariety of semigroups of triangular matrices over a finite field ⋮ Logic, semigroups and automata on words
Cites Work
