Recognizable languages of arrows and cospans

DOI10.1017/S096012951800018XMaRDI QIDQ4585008zbMATH OpenOpenAlexWikidataFDO

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

Publication date 5 September 2018

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s096012951800018x

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Categories of machines, automata (18B20) Formal languages and automata (68Q45)

Recommendations

• Recognizable vs. Regular Picture Languages
• Recognizable Picture Languages and Polyominoes
• Unambiguous recognizable two-dimensional languages
• On the Recognizability of Arrow and Graph Languages
• Recognizable picture languages and domino tiling
• A new notation for arrows
• Picture languages
• On regular drawn symbolic picture languages

Cites work

• A comparison of compatible, finite, and inductive graph properties
• Adhesive and quasiadhesive categories
• Automata for the verification of monadic second-order graph properties
• Bounded treewidth as a key to tractability of knowledge representation and reasoning
• Categorical logic and type theory
• Concurrency, graphs and models. Essays dedicated to Ugo Montanari on the occasion of his 65th birthday
• Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
• Fundamentals of algebraic graph transformation
• Graph automata
• Graph expressions and graph rewritings
• Graph structure and monadic second-order logic. A language-theoretic approach
• Handbook of Graph Grammars and Computing by Graph Transformation
• scientific article; zbMATH DE number 1189283 (Why is no real title available?)
• scientific article; zbMATH DE number 2028929 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• scientific article; zbMATH DE number 2222245 (Why is no real title available?)
• Match-bounded string rewriting systems
• Query evaluation via tree-decompositions
• Recognizability of graph and pattern languages
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The recognizability of sets of graphs is a robust property

Cited in

(5)

• A logic on subobjects and recognizability
• On the Recognizability of Arrow and Graph Languages
• scientific article; zbMATH DE number 2222245 (Why is no real title available?)
• Context-free languages of string diagrams
• Finite automata for efficient graph recognition

This page was built for publication: Recognizable languages of arrows and cospans

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