Associate languages and derivational complexity of formal grammars and languages
From MaRDI portal
Publication:5668008
DOI10.1016/S0019-9958(73)90237-4zbMath0254.68017MaRDI QIDQ5668008
Publication date: 1973
Published in: Information and Control (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
On homomorphic images of left szilard languages, Ranking and unranking left szilard languages, Computing by observing: simple systems and simple observers, On context-free and Szilard languages, The grammatical inference problem for the Szilard languages of linear grammars, On derivation preservation, A note on depth-first derivations, An undecidable problem for context-free grammars, On permutative grammars generating context-free languages, A note on pure grammars, The characterization of parallel ultralinear grammars by rational power series, Interactive languages, n-reconstructability of context-free grammars, On Szilard's languages associated to a matrix grammar, Two decidability results for deterministic pushdown automata, Efficient coding of formalized messages, Polynomial-time identification of very simple grammars from positive data., A note on undercover relation, On derivation languages corresponding to context-free grammars, On homomorphic images of szilard languages, Notes on canonical label languages, Abstract families of context-free grammars, A normal form theorem for label grammars, Derivation languages of grammar forms†, Some formal results about stratificational grammars and their relevance to linguistics, Unnamed Item, Control sets on grammars using depth-first derivations
