Some classifications of context-free languages
From MaRDI portal
Publication:5562596
DOI10.1016/S0019-9958(69)90055-2zbMath0174.28901MaRDI QIDQ5562596
Publication date: 1969
Published in: Information and Control (Search for Journal in Brave)
Related Items (22)
Unnamed Item ⋮ Algebraic program analysis ⋮ Generating all permutations by context-free grammars in Chomsky normal form ⋮ Generating all permutations by context-free grammars in Greibach normal form ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources ⋮ On the size of components of cooperating grammar systems ⋮ Concise description of finite languages ⋮ A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS ⋮ Descriptional complexity of context-free grammar forms ⋮ On coupled languages and translations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM ⋮ On the cover complexity of finite languages ⋮ Theory of formal grammars ⋮ Unnamed Item ⋮ Simulating finite automata with context-free grammars. ⋮ Complexity of normal form grammars
This page was built for publication: Some classifications of context-free languages
