Efficient recognition algorithms for boundary and linear eNCE graph languages

DOI10.1007/PL00013320zbMath0973.68106OpenAlexW2088143457MaRDI QIDQ5941743

Changwook Kim

Publication date: 26 August 2001

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00013320

zbMATH Keywords

eNCE graph languagesgraph grammar

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

Algorithmic uses of the Feferman-Vaught theorem ⋮ On the structure of linear apex NLC graph grammars ⋮ Quasi-rocking real-time pushdown automata ⋮ Double Greibach operator grammars

This page was built for publication: Efficient recognition algorithms for boundary and linear eNCE graph languages