A note on algebras of languages

DOI10.1016/J.TCS.2011.08.022zbMath1228.68038OpenAlexW1985998723MaRDI QIDQ650885

Claudio Marini, Marianna Sorrentino, Andrea Sorbi, Giulia Simi

Publication date: 7 December 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.022

zbMATH Keywords

Boolean algebrasregular languagescontext-sensitive languagesalgebras of languagesdecidable languagesFréchet ideal

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (2)

The Boolean Algebra of Piecewise Testable Languages ⋮ Boolean algebras of regular languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The method of forced enumeration for nondeterministic automata
• A note on the space complexity of some decision problems for finite automata
• Space-bounded reducibility among combinatorial problems
• Boolean algebras of regular languages
• Relationships between nondeterministic and deterministic tape complexities
• Nondeterministic Space is Closed under Complementation
• The Structure of the Lattice of Recursive Sets
• On the Lattice of Recursively Enumerable Sets

This page was built for publication: A note on algebras of languages