Publication:5541336
From MaRDI portal
zbMath0158.25401MaRDI QIDQ5541336
Publication date: 1967
Full work available at URL: https://eudml.org/doc/28685
Related Items
Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity, Unnamed Item, Language classes generated by tree controlled grammars with bounded nonterminal complexity, On bounded interpretations of grammar forms, Concise description of finite languages, Descriptional complexity of context-free grammar forms, Fast deterministic parsers for transition networks, Syntactic complexity of context-free grammars over word monoids, Simulating finite automata with context-free grammars., Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet, On the cover complexity of finite languages, A characterization of context-free languages, Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources, Contextual grammars vs. context-free algebras, Unnamed Item, Unnamed Item
Uses Software
Cites Work