One-sided and two-sided context in formal grammars

Cited in

(30)

Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes
Traces of term-automatic graphs
One-sided random context grammars
Die Zeitkomplexität des Normalisierungsproblems bei kontextsensitiven Grammatiken
Insertion-deletion systems with substitutions. I
On restricted context-free grammars
Generative power of matrix insertion-deletion systems with context-free insertion or deletion
Insertion-deletion with substitutions. II: About the role of one-sided context
Investigations on the power of matrix insertion-deletion systems with small sizes
Structural equivalence and ET0L grammars
Term rewriting with prefix context constraints and bottom-up strategies
Rewriting systems with limited distance permitting context
Families of automata characterizing context-sensitive languages
Generalized one-sided forbidding grammars
Forbidding ET0L grammars.
Controlled term rewriting
Left transformation languages
Accepting grammars with regulation
Priorities on context conditions in rewriting systems
Rewriting systems with a clocking mechanism
Context-free grammars with graph-controlled tables
Manipulating derivation forests by scheduling techniques
\(\mathcal{L}\)-reduction computation revisited
Yield-languages recognized by alternating tree recognizers
Rewriting systems with limited distance forbidding context
The synchronized graphs trace the context-sensitive languages
On grammars with local and global context conditions
Multi grammars
Context-free like restrictions on selective rewriting
Homogeneous grammars with a reduced number of non-context-free products

This page was built for publication: One-sided and two-sided context in formal grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4768640)