In Search of Most Complex Regular Languages

DOI10.1007/978-3-642-31606-7_2MaRDI QIDQ2914690zbMATH OpenOpenAlexFDO

Authors Janusz Brzozowski

Publication date 20 September 2012

Published in Implementation and Application of Automata (Search for Journal in Brave)

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

zbMATH Keywords

combined operationfinite automatonoperationregular languagestate complexitysyntactic semigroupwitness

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• In search of most complex regular languages
• Most complex non-returning regular languages
• Most complex non-returning regular languages
• Most complex regular ideal languages
• Towards a theory of complexity of regular languages
• Most complex deterministic union-free regular languages
• scientific article; zbMATH DE number 3843141
• Combinatorial Complexity of Regular Languages
• The dissecting power of regular languages
• Descriptional complexity of regular languages

Cited in

(9)

• On the descriptional complexity of stateless deterministic ordered restarting automata
• Complexity of regex crosswords
• Most complex non-returning regular languages
• A hitchhiker's guide to descriptional complexity through analytic combinatorics
• Most complex non-returning regular languages
• Towards a theory of complexity of regular languages
• In search of most complex regular languages
• Most Complex Regular Right-Ideal Languages
• Most complex deterministic union-free regular languages

This page was built for publication: In Search of Most Complex Regular Languages

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