scientific article; zbMATH DE number 7559390
From MaRDI portal
Publication:5089180
Cites work
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- An algebraic theory of graph reduction
- Elements of automata theory. Translated from the French by Reuben Thomas
- Equivalence of deterministic top-down tree-to-string transducers is decidable
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 4081531 (Why is no real title available?)
- scientific article; zbMATH DE number 177441 (Why is no real title available?)
- scientific article; zbMATH DE number 6862107 (Why is no real title available?)
- scientific article; zbMATH DE number 7561353 (Why is no real title available?)
- Lov\'asz Meets Weisfeiler and Leman
- MSO definable string transductions and two-way finite-state transducers
- Operations with structures
- Regular functions and cost register automata (invited paper)
- Semantics of context-free languages
- The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- The structure of the models of decidable monadic theories of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089180)
