Hierarchies of Piecewise Testable Languages

DOI10.1007/978-3-540-85780-8_38MaRDI QIDQ3533034zbMATH OpenOpenAlexFDO

Authors Ondřej Klíma, Libor Polák

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 languagessyntactic monoidvarieties of languages

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Recommendations

• Hierarchies 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
• On the word problem for syntactic monoids of piecewise testable languages.
• Piecewise testable languages via combinatorics on words

Cites work

• A classification of rational languages by semilattice-ordered monoids.
• A proof of Simon's theorem on piecewise testable languages
• Characterizations of some classes of regular events
• Eilenberg's theorem for positive varieties of languages
• Equations and monoid varieties of dot-depth one and two
• Games, equations and the dot-depth hierarchy
• Hierarchies of Piecewise Testable Languages
• scientific article; zbMATH DE number 2086254 (Why is no real title available?)
• scientific article; zbMATH DE number 988805 (Why is no real title available?)
• scientific article; zbMATH DE number 4028925 (Why is no real title available?)
• scientific article; zbMATH DE number 3495598 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 2016845 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 798167 (Why is no real title available?)
• Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
• Mathematical Foundations of Computer Science 2004
• On finite \(\mathcal J\)-trivial monoids
• On varieties of meet automata
• Partially ordered finite monoids and a theorem of I. Simon
• Polynomial closure and unambiguous product
• REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT

Cited in

(8)

• On Boolean combinations forming piecewise testable languages
• Hierarchies of Piecewise Testable Languages
• Hierarchies of piecewise testable languages
• A hierarchy of cyclic languages
• On the word problem for syntactic monoids of piecewise testable languages.
• REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT
• Separability by piecewise testable languages and downward closures beyond subwords
• scientific article; zbMATH DE number 7056230 (Why is no real title available?)

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 Q3533034)