Hierarchies of piecewise testable languages
From MaRDI portal
Publication:3586402
DOI10.1142/S0129054110007404zbMATH Open1205.68206MaRDI QIDQ3586402FDOQ3586402
Authors: Ondřej Klíma, Libor Polák 
Publication date: 6 September 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- Hierarchies of Piecewise Testable Languages
- On the word problem for syntactic monoids of piecewise testable languages.
- REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT
- SUBHIERARCHIES OF THE SECOND LEVEL IN THE STRAUBING–THÉRIEN HIERARCHY
- Piecewise testable languages via combinatorics on words
Cites Work
- Characterizations of some classes of regular events
- Equations and monoid varieties of dot-depth one and two
- Games, equations and the dot-depth hierarchy
- On finite \(\mathcal J\)-trivial monoids
- Partially ordered finite monoids and a theorem of I. Simon
- A proof of Simon's theorem on piecewise testable languages
- Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
- REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT
- On varieties of meet automata
Cited In (7)
- The Boolean algebra of piecewise testable languages
- Obituary: Libor Polák (1950--2020)
- On Boolean combinations forming piecewise testable languages
- On the word problem for syntactic monoids of piecewise testable languages.
- Hierarchies of Piecewise Testable Languages
- Title not available (Why is that?)
- REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT
This page was built for publication: Hierarchies of piecewise testable languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586402)
