scientific article; zbMATH DE number 5309909

DOI10.25596/JALC-2007-079MaRDI QIDQ3517096zbMATH OpenFDO

Authors Michael Domaratzki, Alexander Okhotin, Jeffrey Shallit

Publication date 12 August 2008

Full work available at URL https://doi.org/10.25596/JALC-2007-079

zbMATH Keywords

arithmetical hierarchyundecidability

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1261119
• scientific article; zbMATH DE number 3254902
• Context-free complexity of finite languages
• Context-Free Languages of Countable Words
• Characterization of context-free languages
• scientific article; zbMATH DE number 4033108
• scientific article; zbMATH DE number 2150276
• Context-free grammars, generating functions and combinatorial arrays
• scientific article; zbMATH DE number 4011962
• scientific article; zbMATH DE number 58294

Cited in

(6)

• The complexity of computing the number of strings of given length in context-free languages
• Enumerating regular expressions and their languages
• Context-Free Languages of Countable Words
• Efficient Enumeration of Regular Languages
• scientific article; zbMATH DE number 4011962 (Why is no real title available?)
• Context free closed families of languages

This page was built for publication:

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