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)
Related Items (30)
Insertion-deletion systems with substitutions I ⋮ Controlled Term Rewriting ⋮ Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies ⋮ \(\mathcal{L}\)-reduction computation revisited ⋮ Accepting grammars with regulation ⋮ Investigations on the power of matrix insertion-deletion systems with small sizes ⋮ On grammars with local and global context conditions ⋮ On restricted context-free grammars ⋮ Context-free like restrictions on selective rewriting ⋮ Left transformation languages ⋮ Traces of term-automatic graphs ⋮ Unnamed Item ⋮ Forbidding ET0L grammars. ⋮ Yield-languages recognized by alternating tree recognizers ⋮ Structural equivalence and ET0L grammars ⋮ Unnamed Item ⋮ Families of automata characterizing context-sensitive languages ⋮ Context-free grammars with graph-controlled tables ⋮ Die Zeitkomplexität des Normalisierungsproblems bei kontextsensitiven Grammatiken ⋮ Rewriting systems with limited distance permitting context ⋮ Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion ⋮ Priorities on context conditions in rewriting systems ⋮ Rewriting systems with a clocking mechanism ⋮ Manipulating derivation forests by scheduling techniques ⋮ One-sided random context grammars ⋮ Multi grammars ⋮ Homogeneous grammars with a reduced number of non-context-free products ⋮ Rewriting systems with limited distance forbidding context ⋮ Generalized one-sided forbidding grammars ⋮ Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes
This page was built for publication: One-sided and two-sided context in formal grammars
