Graph automata for linear graph languages

DOI10.1007/3-540-61228-9_97zbMath1412.68123OpenAlexW1598633555MaRDI QIDQ4645286

Konstantin Skodinis, Franz-Josef Brandenburg

Publication date: 10 January 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61228-9_97

zbMATH Keywords

graph grammarfinite state automatoninput graphnode labelterminal node

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Finite graph automata for linear and boundary graph languages

Cites Work

• The bounded degree problem for NLC grammars is decidable
• Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
• Recognition of graphs by automata
• Linear graph grammars: Power and complexity
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• The complexity of searching a graph
• Cellular graph automata. I. basic concepts, graph property measurement, closure properties
• Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition
• Monotonicity in graph searching
• Recontamination does not help to search a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph automata for linear graph languages