What is a complex regular language?

DOI10.25596/JALC-2018-111MaRDI QIDQ5376333zbMATH OpenFDO

Authors C. Câmpeanu

Publication date 17 September 2018

Full work available at URL https://doi.org/10.25596/JALC-2018-111

zbMATH Keywords

Blum static complexityKolmogorov complexityrandomnessregular languagestate complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Formal languages and automata (68Q45)

Recommendations

• State complexity of regular languages
• scientific article; zbMATH DE number 3843141
• Towards a theory of complexity of regular languages
• On the number of accepting states of finite automata
• In search of most complex regular languages

Cited in

(1)

• scientific article; zbMATH DE number 3843141 (Why is no real title available?)

This page was built for publication: What is a complex regular language?

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