One-sided and two-sided context in formal grammars
From MaRDI portal
Publication:4768640
DOI10.1016/S0019-9958(74)91049-3zbMath0282.68035WikidataQ55889762 ScholiaQ55889762MaRDI QIDQ4768640
Publication date: 1974
Published in: Information and Control (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
On grammars with local and global context conditions, Multi grammars, Accepting grammars with regulation, Structural equivalence and ET0L grammars, Priorities on context conditions in rewriting systems, Rewriting systems with a clocking mechanism, Context-free like restrictions on selective rewriting, Left transformation languages, Context-free grammars with graph-controlled tables, Die Zeitkomplexität des Normalisierungsproblems bei kontextsensitiven Grammatiken, Forbidding ET0L grammars., Families of automata characterizing context-sensitive languages, Manipulating derivation forests by scheduling techniques, Homogeneous grammars with a reduced number of non-context-free products, Traces of term-automatic graphs, Yield-languages recognized by alternating tree recognizers, Rewriting systems with limited distance permitting context, Rewriting systems with limited distance forbidding context