Recognizability of graph and pattern languages

DOI10.1007/s00236-006-0006-zzbMath1089.68052OpenAlexW1987373794MaRDI QIDQ2491214

Antonios Kalampakas, Symeon Bozapalidis

Publication date: 26 May 2006

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-006-0006-z

zbMATH Keywords

syntactic magmoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Recognizable languages of arrows and cospans ⋮ The Syntactic Complexity of Eulerian Graphs ⋮ Syntactic recognizability of graphs with fuzzy attributes ⋮ On the syntactic complexity of tree series ⋮ Graph automata ⋮ MINIMIZATION OF PLANAR DIRECTED ACYCLIC GRAPH ALGEBRAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An axiomatization of graphs
• IO and OI. I
• Context-free graph grammars and concatenation of graphs
• A Kleene theorem for a class of planar acyclic graphs
• An algebraic presentation of term graphs, via gs-monoidal categories
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Graph expressions and graph rewritings
• Parallel and two-way automata on directed ordered acyclic graphs
• The basic algebraic structures in categories of derivations
• Exponential Numbers
• Algebraic automata and context-free sets

This page was built for publication: Recognizability of graph and pattern languages