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)
Related Items (28)
Polynomial-time identification of very simple grammars from positive data. ⋮ Some formal results about stratificational grammars and their relevance to linguistics ⋮ A note on pure grammars ⋮ Computing by observing: simple systems and simple observers ⋮ The characterization of parallel ultralinear grammars by rational power series ⋮ On homomorphic images of left szilard languages ⋮ Unnamed Item ⋮ On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2 ⋮ The grammatical inference problem for the Szilard languages of linear grammars ⋮ On homomorphic images of szilard languages ⋮ Ranking and unranking left szilard languages ⋮ A note on undercover relation ⋮ Interactive languages ⋮ Notes on canonical label languages ⋮ n-reconstructability of context-free grammars ⋮ On Szilard's languages associated to a matrix grammar ⋮ Two decidability results for deterministic pushdown automata ⋮ Abstract families of context-free grammars ⋮ Efficient coding of formalized messages ⋮ Control sets on grammars using depth-first derivations ⋮ On derivation languages corresponding to context-free grammars ⋮ On context-free and Szilard languages ⋮ A normal form theorem for label grammars ⋮ Derivation languages of grammar forms† ⋮ On derivation preservation ⋮ A note on depth-first derivations ⋮ An undecidable problem for context-free grammars ⋮ On permutative grammars generating context-free languages
This page was built for publication: Associate languages and derivational complexity of formal grammars and languages
