Graph automata for linear graph languages
From MaRDI portal
Publication:4645286
DOI10.1007/3-540-61228-9_97zbMATH Open1412.68123OpenAlexW1598633555MaRDI QIDQ4645286FDOQ4645286
Authors: Konstantin Skodinis, Franz J. 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
Recommendations
- Finite graph automata for linear and boundary graph languages
- Graph automata
- scientific article; zbMATH DE number 7604432
- scientific article; zbMATH DE number 2031101
- Linear graph grammars: Power and complexity
- scientific article; zbMATH DE number 2016084
- scientific article; zbMATH DE number 3858446
- Graph adjacency matrix automata
- scientific article; zbMATH DE number 1759440
- scientific article
Cites Work
- Title not available (Why is that?)
- The complexity of searching a graph
- Recontamination does not help to search a graph
- Title not available (Why is that?)
- Monotonicity in graph searching
- Linear graph grammars: Power and complexity
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- The bounded degree problem for NLC grammars is decidable
- Cellular graph automata. I. basic concepts, graph property measurement, closure properties
- Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition
- Title not available (Why is that?)
- Recognition of graphs by automata
Cited In (6)
This page was built for publication: Graph automata for linear graph languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645286)
