Order independent NCE grammars recognized in polynomial time

DOI10.1016/0020-0190(91)90113-VzbMath0735.68040OpenAlexW2012231952MaRDI QIDQ1182091

Janice Jeffs

Publication date: 27 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90113-v

zbMATH Keywords

order independentconfluent graph grammars

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Node replacements in embedding normal form.

Cites Work

• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Graph grammars with neighbourhood-controlled embedding
• Handle-rewriting hypergraph grammars
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Order independent NCE grammars recognized in polynomial time