On the Recognizability of Arrow and Graph Languages

DOI10.1007/978-3-540-87405-8_23MaRDI QIDQ3540409zbMATH OpenOpenAlexFDO

Authors H. J. Sander Bruggink, Barbara König

Publication date 20 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87405-8_23

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Categories of machines, automata (18B20)

Recommendations

• Recognizable languages of arrows and cospans
• Recognizability of graph and pattern languages
• A logic on subobjects and recognizability
• Recognizable sets of graphs: equivalent definitions and closure properties
• The recognizability of sets of graphs is a robust property

Cited in

(7)

• Recognizability of graph and pattern languages
• scientific article; zbMATH DE number 4121455 (Why is no real title available?)
• Causality in bounded Petri nets is MSO definable
• Synthesis and Analysis of Petri Nets from Causal Specifications
• A logic on subobjects and recognizability
• Reachability in graph transformation systems and slice languages
• Recognizable languages of arrows and cospans

This page was built for publication: On the Recognizability of Arrow and Graph Languages

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