Square on ideal, closed and free languages

DOI10.1007/978-3-319-19225-3_6MaRDI QIDQ5500682zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Square, power, positive closure, and complementation on star-free languages
• Nondeterministic complexity of operations on closed and ideal languages
• On the square of regular languages
• Complement on free and ideal languages
• Syntactic complexity of ideal and closed languages

Cites work

• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 7315105 (Why is no real title available?)
• Determination of finite automata accepting subregular languages
• On NFAs where all states are final, initial, or both
• Operations on automata with all states final
• Quotient complexity of bifix-, factor-, and subword-free regular languages
• Quotient complexity of ideal languages
• State Complexity of Basic Operations on Suffix-Free Regular Languages
• Syntactic complexity of ideal and closed languages
• The state complexities of some basic operations on regular languages
• The state complexity of \(L^{2}\) and \(L^k\)

Cited in

(2)

• Power, positive closure, and quotients on convex languages
• Nondeterministic complexity of operations on closed and ideal languages

This page was built for publication: Square on ideal, closed and free languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500682)