Hierarchies of Piecewise Testable Languages

DOI10.1007/978-3-540-85780-8_38zbMath1159.68023MaRDI QIDQ3533034

Libor Polák, Ondřej Klíma

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_38

zbMATH Keywords

piecewise testable languages; syntactic monoid; varieties of languages

Mathematics Subject Classification ID

68Q70: Algebraic theory of languages and automata

Related Items

Hierarchies of Piecewise Testable Languages

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
• Polynomial closure and unambiguous product
• A proof of Simon's theorem on piecewise testable languages
• Games, equations and the dot-depth hierarchy
• Eilenberg's theorem for positive varieties of languages
• Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
• Hierarchies of Piecewise Testable Languages
• REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT
• Mathematical Foundations of Computer Science 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item