Quotient Complexity of Ideal Languages

DOI10.1007/978-3-642-12200-2_20MaRDI QIDQ3557022zbMATH OpenOpenAlexFDO

Authors Galina Jirásková, Baiyu Li, Janusz Brzozowski

Publication date 27 April 2010

Published in LATIN 2010: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10012/12624

zbMATH Keywords

automatoncomplexityideallanguagequotientregular expressionregular operationstate complexityupper bound

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Quotient complexity of ideal languages
• Quotient complexities of atoms in regular ideal languages
• Quotient complexity of regular languages
• QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
• Quotient complexity of star-free languages
• Syntactic complexity of ideal and closed languages
• Nondeterministic complexity of operations on closed and ideal languages
• The computational complexity of ideal semantics

Cited in

(15)

• The computational complexity of ideal semantics
• Quotient complexity of ideal languages
• Networks of evolutionary processors: the power of subregular filters
• Quotient complexities of atoms in regular ideal languages
• Most complex regular ideal languages
• State complexity of neighbourhoods and approximate pattern matching
• Shuffled languages -- representation and recognition
• Middle quotients of linear languages
• On external contextual grammars with subregular selection languages
• Reversal of binary regular languages
• State complexity of neighbourhoods and approximate pattern matching
• Descriptional complexity of error detection
• QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
• Quotient complexity of regular languages
• Note on reversal of binary regular languages

This page was built for publication: Quotient Complexity of Ideal Languages

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