Finite automata for efficient graph recognition

DOI10.4204/EPTCS.417.8MaRDI QIDQ6934015zbMATH OpenFDO

Authors Frank Drewes, Berthold Hoffmann, Mark Minas

Publication date 3 September 2025

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

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

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)