A Kleene theorem for a class of planar acyclic graphs

DOI10.1006/INCO.1995.1043zbMATH Open0826.68089OpenAlexW1982255273MaRDI QIDQ1892880FDOQ1892880

Authors: Francis Bossut, Max Dauchet, 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

Recommendations

• scientific article; zbMATH DE number 4072412
• The Kleene Equality for Graphs
• scientific article; zbMATH DE number 4039338
• A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
• Developments in Language Theory

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)

Cited In (9)

• Recognizability of graph and pattern languages
• Regular planar monoidal languages
• An axiomatization of graphs
• Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
• Concatenation of graphs
• Graph automata
• Multilinear representations of free pros
• Title not available (Why is that?)
• The Kleene Equality for Graphs

This page was built for publication: A Kleene theorem for a class of planar acyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892880)