Finite automata for efficient graph recognition
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 1189283 (Why is no real title available?)
- scientific article; zbMATH DE number 177465 (Why is no real title available?)
- (Re)introducing regular graph languages
- Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power
- Algebra automata I: Parallel programming as a prolegomena to the categorical approach
- Context-free graph grammars and concatenation of graphs
- Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars
- Finite automata on directed graphs
- Finite graph automata for linear and boundary graph languages
- Finite graph-acceptors and regular graph-languages
- Formal Methods in Software and Systems Modeling
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
- Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
- Graph automata
- Hyperedge replacement: grammars and languages
- On the membership problem for regular DNLC grammars
- Predictive shift-reduce parsing for hyperedge replacement grammars
- Predictive top-down parsing for hyperedge replacement grammars
- Recognising k-connected hypergraphs in cubic time
- Recognizability of graph and pattern languages
- Recognizable languages of arrows and cospans
- Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
- The complexity of graph languages generated by hyperedge replacement
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Cited in
(1)
This page was built for publication: Finite automata for efficient graph recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6934015)
