A note on scattered context grammars

DOI10.1016/0020-0190(71)90004-4zbMath0227.68040OpenAlexW2014399224MaRDI QIDQ2549582

David L. Milgram, Azriel Rosenfeld

Publication date: 1971

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027/coo.31924004652818

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42)

Related Items (8)

Independent parallelism in finite copying parallel rewriting systems ⋮ Size, index, and context-sensitivity of controlled partition grammars ⋮ Classes of formal grammars ⋮ Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way ⋮ An observation on scattered grammars ⋮ 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 ⋮ Normal forms for context-sensitive grammars

Cites Work

• Scattered context grammars
• Programmed Grammars and Classes of Formal Languages
• Separable graphs, planar graphs and web grammars

This page was built for publication: A note on scattered context grammars