HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES
From MaRDI portal
Publication:3586402
DOI10.1142/S0129054110007404zbMath1205.68206MaRDI QIDQ3586402
Publication date: 6 September 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- On varieties of meet automata
- Characterizations of some classes of regular events
- Partially ordered finite monoids and a theorem of I. Simon
- On finite \(\mathcal J\)-trivial monoids
- Equations and monoid varieties of dot-depth one and two
- A proof of Simon's theorem on piecewise testable languages
- Games, equations and the dot-depth hierarchy
- 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
This page was built for publication: HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES
