Some classifications of context-free languages

DOI10.1016/S0019-9958(69)90055-2MaRDI QIDQ5562596zbMATH OpenFDO

Authors Jozef Gruska

Publication date 1969

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(69)90055-2

zbMATH Keywords

languages, automata, networks

Cited in

(23)

• Concise description of finite languages
• Descriptional complexity of context-free grammar forms
• Theory of formal grammars
• Simulating finite automata with context-free grammars.
• On the cover complexity of finite languages
• Generating all permutations by context-free grammars in Chomsky normal form
• Generating all permutations by context-free grammars in Greibach normal form
• Conditional Lindenmayer systems with conditions defined by bounded resources
• scientific article; zbMATH DE number 3850491 (Why is no real title available?)
• scientific article; zbMATH DE number 3858419 (Why is no real title available?)
• GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM
• scientific article; zbMATH DE number 97565 (Why is no real title available?)
• scientific article; zbMATH DE number 3478420 (Why is no real title available?)
• On coupled languages and translations
• scientific article; zbMATH DE number 3438423 (Why is no real title available?)
• scientific article; zbMATH DE number 3430145 (Why is no real title available?)
• scientific article; zbMATH DE number 3381865 (Why is no real title available?)
• scientific article; zbMATH DE number 958372 (Why is no real title available?)
• A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS
• On the size of components of cooperating grammar systems
• Pareto grammars
• Complexity of normal form grammars
• Algebraic program analysis

This page was built for publication: Some classifications of context-free languages

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