Some remarks on derivations in general rewriting systems

DOI10.1016/S0019-9958(68)90178-2zbMath0162.31901OpenAlexW2053350018MaRDI QIDQ5545960

T. V. Griffiths

Publication date: 1968

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

Full work available at URL: https://doi.org/10.1016/s0019-9958(68)90178-2

zbMATH Keywords

languages, automata, networks

Related Items

Cancellation in context-free languages: enrichment by reduction, An algebraic structure for derivations in rewriting systems, Growing context-sensitive languages and Church-Rosser languages, McNaughton families of languages., The derivational complexity of string rewriting systems, Semantic preserving translations, On the structure of context-sensitive grammars, On the power of cooperation: A regular representation of recursively enumerable languages, On a kind of Fatou property of context-free groups, On the computing powers of \(\mathcal{L}\)-reductions of insertion languages, The derivation language of a phrase structure grammar, Notes on canonical label languages, Time-bounded grammars and their languages, A homomorphism theorem for weighted context-free grammars, The relation between derivations and syntactical structures in phrase- structure grammars, Categorical and topological aspects of formal languages, Homogeneous grammars with a reduced number of non-context-free products, Enumerating syntactical graphs and lattices of derivations