Square on Ideal, Closed and Free Languages

DOI10.1007/978-3-319-19225-3_6zbMath1432.68220OpenAlexW1051743951MaRDI QIDQ5500682

Kristína Čevorová

Publication date: 7 August 2015

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19225-3_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Power, positive closure, and quotients on convex languages ⋮ Nondeterministic Complexity of Operations on Closed and Ideal Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The state complexity of \(L^{2}\) and \(L^k\)
• On NFAs where all states are final, initial, or both
• The state complexities of some basic operations on regular languages
• Quotient complexity of closed languages
• Quotient complexity of ideal languages
• Determination of finite automata accepting subregular languages
• State Complexity of Basic Operations on Suffix-Free Regular Languages
• Syntactic Complexity of Ideal and Closed Languages