Kuratowski Algebras Generated by Prefix-Free Languages

DOI10.1007/978-3-319-40946-7_13zbMath1475.68157OpenAlexW2505656620MaRDI QIDQ2830215

Juraj Šebej, Jozef jun. Jirásek

Publication date: 9 November 2016

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40946-7_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (2)

Numerical investigation of a nonlinear time-optimal problem ⋮ Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prefix-free languages: left and right quotient and reversal
• On the boundary of regular languages
• CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM
• Kleene Closure on Regular and Prefix-Free Languages
• The Boundary of Prefix-Free Languages
• State Complexity of Boundary of Prefix-Free Regular Languages
• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• The Kuratowski Closure-Complement Problem
• Cyclic Shift on Prefix-Free Languages
• Star-Complement-Star on Prefix-Free Languages

This page was built for publication: Kuratowski Algebras Generated by Prefix-Free Languages