Order independent NCE grammars recognized in polynomial time

DOI10.1016/0020-0190(91)90113-VMaRDI QIDQ1182091zbMATH OpenOpenAlexFDO

Authors 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

confluent graph grammarsorder independent

Mathematics Subject Classification ID

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

Cites work

• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Graph grammars with neighbourhood-controlled embedding
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 3943061 (Why is no real title available?)
• scientific article; zbMATH DE number 4049103 (Why is no real title available?)
• scientific article; zbMATH DE number 17539 (Why is no real title available?)

Cited in

(1)

• Node replacements in embedding normal form.

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

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