Some restrictive devices for context-free grammars
From MaRDI portal
Publication:5661157
DOI10.1016/S0019-9958(72)90287-2zbMath0248.68035OpenAlexW1979877014MaRDI QIDQ5661157
Publication date: 1972
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(72)90287-2
Related Items (22)
Adding global forbidding context to context-free grammars ⋮ Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages ⋮ Unnamed Item ⋮ On restricted context-free grammars ⋮ Simple restriction in context-free rewriting ⋮ Independent parallelism in finite copying parallel rewriting systems ⋮ Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars ⋮ On the characterization of certain classes of developmental languages by automata ⋮ Size, index, and context-sensitivity of controlled partition grammars ⋮ Classes of formal grammars ⋮ A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions ⋮ On context-free rewriting with a simple restriction and its computational completeness ⋮ An observation on scattered grammars ⋮ Unnamed Item ⋮ An algebraic technique for context-sensitive parsing ⋮ An infinite hierarchy of language families generated by scattered context grammars with \(n\)-limited derivations ⋮ Trading independent for synchronized parallelism in finite copying parallel rewriting systems ⋮ Priorities on context conditions in rewriting systems ⋮ Rewriting systems with a clocking mechanism ⋮ A note on leftmost restricted random context grammars ⋮ Normal forms for context-sensitive grammars ⋮ A variant of random context grammars: Semi-conditional grammars
This page was built for publication: Some restrictive devices for context-free grammars
