Square on ideal, closed and free languages

DOI10.1007/978-3-319-19225-3_6zbMATH Open1432.68220OpenAlexW1051743951MaRDI QIDQ5500682FDOQ5500682

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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

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)