scientific article; zbMATH DE number 3351211
From MaRDI portal
Publication:5626298
zbMath0221.68047MaRDI QIDQ5626298
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42)
Related Items (23)
Adding global forbidding context to context-free grammars ⋮ A hierarchy of random-context grammars and automata ⋮ Random context structure grammars and automata - a formal approach ⋮ Unnamed Item ⋮ Using random context structure grammars to represent chemical structures ⋮ An object-based version of the path context model ⋮ A property of random context picture grammars ⋮ On restricted context-free grammars ⋮ Forbidding ET0L grammars. ⋮ On the characterization of certain classes of developmental languages by automata ⋮ On TOL languages over terminals ⋮ More on ETOL systems versus random context grammars ⋮ A pumping lemma for random permitting context languages ⋮ A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions ⋮ Dynamically controlled cooperating/distributed grammar systems ⋮ On context-free rewriting with a simple restriction and its computational completeness ⋮ Priorities on context conditions in rewriting systems ⋮ Rewriting systems with a clocking mechanism ⋮ One-sided random context grammars ⋮ A note on leftmost restricted random context grammars ⋮ Normal forms for context-sensitive grammars ⋮ Structure graphs and structure graph grammars ⋮ A variant of random context grammars: Semi-conditional grammars
This page was built for publication:
