Efficient recognition algorithms for boundary and linear eNCE graph languages

DOI10.1007/PL00013320MaRDI QIDQ5941743zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Finite graph automata for linear and boundary graph languages
• Two Algorithms For Languages Recognized By Graph Algebras
• Recognizability of graph and pattern languages
• scientific article; zbMATH DE number 3909759
• EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES
• scientific article; zbMATH DE number 1962778
• scientific article; zbMATH DE number 4060748
• Complexity of boundary graph languages
• A Linear Recognition Algorithm for Cographs
• scientific article; zbMATH DE number 177465

Cited in

(7)

• A hierarchy of eNCE families of graph languages
• Double Greibach operator grammars
• Recognizability of graph and pattern languages
• scientific article; zbMATH DE number 177465 (Why is no real title available?)
• On the structure of linear apex NLC graph grammars
• Algorithmic uses of the Feferman-Vaught theorem
• Quasi-rocking real-time pushdown automata

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

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