The Boolean Algebra of Piecewise Testable Languages

DOI10.1007/978-3-319-40189-8_30zbMath1475.68195OpenAlexW2497652918MaRDI QIDQ3188268

Anton Konovalov, Victor L. 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

Boolean algebraregular languageaperiodic languageFrechét idealpiecewise testable language

Mathematics Subject Classification ID

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

Related Items (2)

Definable Subsets of Polynomial-Time Algebraic Structures ⋮ On the main scientific achievements of Victor Selivanov

Cites Work

• A note on algebras of languages
• Regular languages and Stone duality
• The structure of countable Boolean algebras
• Characterizations of some classes of regular events
• Duality and Equational Theory of Regular Languages
• Hierarchies and reducibilities on regular languages related to modulo counting
• The Boolean algebra of logic
• THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS
• Boolean Algebras of Regular ω-Languages
• Boolean Algebras of Regular Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Boolean Algebra of Piecewise Testable Languages