Nondeterministic operations on finite relational structures

DOI10.1016/S0304-3975(97)00263-6zbMath0916.08004MaRDI QIDQ1276248

Klaus Barthelmann

Publication date: 20 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

hypergraphmonadic second-order logicformal languagetransducercontext-free setmultivalued operations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of universal algebra in computer science (08A70)

Cites Work

• Basic notions of universal algebra for language theory and graph grammars
• Monadic second-order evaluations on tree-decomposable graphs
• The structure of the models of decidable monadic theories of graphs
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• The monadic second-order logic of graphs. VII: Graphs as relational structures
• Minimal acyclic forbidden minors for the family of graphs with bounded path-width
• Monadic second-order definable graph transductions: a survey
• The monadic second-order logic of graphs. X: Linear orderings
• The monadic second-order logic of graphs. VIII: Orientations
• Handle-rewriting hypergraph grammars
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• A mathematical investigation of propagating graph 0L systems
• Graph expressions and graph rewritings
• Bottom-up and top-down tree transformations— a comparison
• Handbook of Graph Grammars and Computing by Graph Transformation
• The use of tree transducers to compute translations between graph algebras
• Algebraic automata and context-free sets
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Automata in general algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nondeterministic operations on finite relational structures