Context-Free Languages of Countable Words

DOI10.1007/978-3-642-03466-4_12MaRDI QIDQ3393407zbMATH OpenOpenAlexFDO

Authors Szabolcs Iván, Zoltán Ésik

Publication date 20 August 2009

Published in Theoretical Aspects of Computing - ICTAC 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03466-4_12

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2150276
• Context-free languages consisting of non-primitive words
• Context-free languages and primitive words
• Context-free complexity of finite languages
• scientific article; zbMATH DE number 5309909
• scientific article; zbMATH DE number 4033108
• On lengths of words in context-free languages
• Context-Freeness of Word-MIX Languages
• Characterization of context-free languages
• scientific article; zbMATH DE number 3254902

Cited in

(13)

• MSO-definable properties of Muller context-free languages are decidable
• Counting Finite Languages by Total Word Length
• scientific article; zbMATH DE number 5309909 (Why is no real title available?)
• On Müller context-free grammars
• Fixed-point characterization of context-free ∞-languages
• Context free closed families of languages
• scientific article; zbMATH DE number 1528682 (Why is no real title available?)
• Linear languages of finite and infinite words
• Context-Freeness of Word-MIX Languages
• Regular expressions for Muller context-free languages
• Büchi context-free languages
• On Müller context-free grammars
• Comparing consecutive letter counts in multiple context-free languages

This page was built for publication: Context-Free Languages of Countable Words

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