scientific article; zbMATH DE number 7559390

DOI10.4230/LIPIcs.MFCS.2020.19MaRDI QIDQ5089180

Janusz Schmude, Mikołaj Bojańczyk

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bounded treewidthHilbert basis theoremequivalence for MSO transductions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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. VI: On several representations of graphs by relational structures
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Streaming Tree Transducers
• The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
• An algebraic theory of graph reduction
• MSO definable string transductions and two-way finite-state transducers
• Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable
• Lov\'asz Meets Weisfeiler and Leman
• Regular Functions and Cost Register Automata
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Semantics of context-free languages
• Operations with structures