Quotient Complexity of Ideal Languages
From MaRDI portal
Publication:3557022
DOI10.1007/978-3-642-12200-2_20zbMath1283.68189MaRDI 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
complexity; upper bound; language; ideal; state complexity; quotient; automaton; regular expression; regular operation
68Q45: Formal languages and automata
Related Items
State Complexity of Neighbourhoods and Approximate Pattern Matching, Descriptional Complexity of Error Detection, Note on Reversal of Binary Regular Languages, Shuffled languages -- representation and recognition, On external contextual grammars with subregular selection languages, Reversal of binary regular languages, Networks of evolutionary processors: the power of subregular filters, State Complexity of Neighbourhoods and Approximate Pattern Matching