A Kleene theorem for a class of planar acyclic graphs

DOI10.1006/inco.1995.1043zbMath0826.68089OpenAlexW1982255273MaRDI QIDQ1892880

Max Dauchet, Francis Bossut, Bruno Warin

Publication date: 10 July 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1043

zbMATH Keywords

Kleene theoremfinite automata on graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Multilinear representations of free pros ⋮ Concatenation of graphs ⋮ Graph automata ⋮ Recognizability of graph and pattern languages ⋮ An axiomatization of graphs ⋮ Graph Automata: The Algebraic Properties of Abelian Relational Graphoids