CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM

DOI10.1142/S0129054111008052zbMath1246.68139OpenAlexW2570765932MaRDI QIDQ3086240

Elyot Grant, Jeffrey O. Shallit, Janusz A. Brzozowski

Publication date: 30 March 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111008052

zbMATH Keywords

complexitydecision problemformal languagecomplementclosure systemconcatenationKuratowski's theorempositive closureKleene closureseparating two words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Topological spaces and generalizations (closure spaces, etc.) (54A05) Grammars and rewriting systems (68Q42)

Related Items (9)

Quotient complexity of closed languages ⋮ The radical-annihilator monoid of a ring ⋮ Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation ⋮ Some remarks on the orbit of closure-involution operations on languages ⋮ Closures in Formal Languages and Kuratowski’s Theorem ⋮ Kuratowski Algebras Generated by Prefix-Free Languages ⋮ Universal Disjunctive Concatenation and Star ⋮ Star-Complement-Star on Prefix-Free Languages ⋮ On the boundary of regular languages

Cites Work

• Unnamed Item
• A generalized closure and complement phenomenon
• Complements and transitive closures
• The Kuratowski Closure-Complement Problem

This page was built for publication: CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM