Developments in Language Theory

DOI10.1007/B103739MaRDI QIDQ5711946zbMATH OpenOpenAlexFDO

Authors Bruno Courcelle

Publication date 22 December 2005

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

Full work available at URL https://doi.org/10.1007/b103739

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• Recognizability, hypergraph operations, and logical types
• On Several Proofs of the Recognizability Theorem
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• scientific article; zbMATH DE number 177437
• The recognizability of sets of graphs is a robust property

Cited in

(15)

• A structural/temporal query language for business processes
• An axiomatization of graphs
• Automata for XML -- a survey
• Verification of graph grammars using a logical approach
• On Several Proofs of the Recognizability Theorem
• scientific article; zbMATH DE number 475419 (Why is no real title available?)
• Formal verification of graph grammars using mathematical induction
• The recognizability of sets of graphs is a robust property
• Recognizable sets of graphs: equivalent definitions and closure properties
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• scientific article; zbMATH DE number 942492 (Why is no real title available?)
• Recognizable series on hypergraphs
• scientific article; zbMATH DE number 177437 (Why is no real title available?)
• Set recognition of decomposable graphs and steps towards their reconstruction
• Recognizable series on graphs and hypergraphs

This page was built for publication: Developments in Language Theory

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