Finite Automata for Efficient Graph Recognition
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908284571615232 |
|---|---|
| author | Drewes, Frank Hoffmann, Berthold Minas, Mark |
| author_facet | Drewes, Frank Hoffmann, Berthold Minas, Mark |
| contents | Engelfriet and Vereijken have shown that linear graph grammars based on hyperedge replacement generate graph languages that can be considered as interpretations of regular string languages over typed symbols. In this paper we show that finite automata can be lifted from strings to graphs within the same framework. For the efficient recognition of graphs with these automata, we make them deterministic by a modified powerset construction, and state sufficient conditions under which deterministic finite graph automata recognize graphs without the need to use backtracking. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_15052 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Finite Automata for Efficient Graph Recognition Drewes, Frank Hoffmann, Berthold Minas, Mark Formal Languages and Automata Theory Engelfriet and Vereijken have shown that linear graph grammars based on hyperedge replacement generate graph languages that can be considered as interpretations of regular string languages over typed symbols. In this paper we show that finite automata can be lifted from strings to graphs within the same framework. For the efficient recognition of graphs with these automata, we make them deterministic by a modified powerset construction, and state sufficient conditions under which deterministic finite graph automata recognize graphs without the need to use backtracking. |
| title | Finite Automata for Efficient Graph Recognition |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2404.15052 |