The Boolean algebra of piecewise testable languages

DOI10.1007/978-3-319-40189-8_30MaRDI QIDQ3188268zbMATH OpenOpenAlexFDO

Authors Anton Konovalov, Victor Selivanov

Publication date 17 August 2016

Published in Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-40189-8_30

zbMATH Keywords

aperiodic languageBoolean algebraFrechét idealpiecewise testable languageregular language

Mathematics Subject Classification ID

Structure theory of Boolean algebras (06E05) Algebraic theory of languages and automata (68Q70)

Recommendations

• Boolean algebras of regular languages
• On Boolean combinations forming piecewise testable languages
• Boolean algebras by length recognizability
• Hierarchies of piecewise testable languages
• An Algebraic Characterization of Strictly Piecewise Languages

Cites work

• A note on algebras of languages
• Boolean Algebras of Regular Languages
• Boolean Algebras of Regular ω-Languages
• Characterizations of some classes of regular events
• Duality and Equational Theory of Regular Languages
• Hierarchies and reducibilities on regular languages related to modulo counting
• scientific article; zbMATH DE number 618821 (Why is no real title available?)
• scientific article; zbMATH DE number 934728 (Why is no real title available?)
• scientific article; zbMATH DE number 6423743 (Why is no real title available?)
• Regular languages and Stone duality
• The Boolean algebra of logic
• THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS
• The structure of countable Boolean algebras

Cited in

(14)

• Characterizations of some classes of regular events
• Boolean algebras of regular languages
• On Boolean combinations forming piecewise testable languages
• Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages
• Symbolic algorithms for language equivalence and Kleene algebra with tests
• An Algebraic Characterization of Strictly Piecewise Languages
• Regular languages of infinite trees that are Boolean combinations of open sets
• Polynomial size test sets for commutative languages
• scientific article; zbMATH DE number 1497854 (Why is no real title available?)
• Definable Subsets of Polynomial-Time Algebraic Structures
• scientific article; zbMATH DE number 7056230 (Why is no real title available?)
• On the main scientific achievements of Victor Selivanov
• Boolean algebras by length recognizability
• A note on algebras of languages

This page was built for publication: The Boolean algebra of piecewise testable languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188268)