Quotient Complexity of Ideal Languages

DOI10.1007/978-3-642-12200-2_20zbMath1283.68189OpenAlexW2174223279MaRDI QIDQ3557022

Galina Jirásková, Baiyu Li, Janusz A. 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

complexityupper boundlanguageidealstate complexityquotientautomatonregular expressionregular operation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

State Complexity of Neighbourhoods and Approximate Pattern Matching ⋮ Networks of evolutionary processors: the power of subregular filters ⋮ Shuffled languages -- representation and recognition ⋮ State Complexity of Neighbourhoods and Approximate Pattern Matching ⋮ On external contextual grammars with subregular selection languages ⋮ Reversal of binary regular languages ⋮ Descriptional Complexity of Error Detection ⋮ Note on Reversal of Binary Regular Languages

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