scientific article; zbMATH DE number 7471714

MaRDI QIDQ5028483

Volker Diekert, Géraud Sénizergues, Besik Dundua, Carlos Camino, Mircea Marin

Publication date: 9 February 2022

Full work available at URL: https://arxiv.org/abs/2004.09926

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

zbMATH Keywords

regular tree languagesinfinite treesfactorization theoryIO and O

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (2)

Superassociative structures of terms and formulas defined by transformations preserving a partition ⋮ The Power-Set Construction for Tree Algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete algebraic methods. Arithmetic, cryptography, automata and groups
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Fundamental properties of infinite trees
• Tree pushdown automata
• Alternating automata on infinite trees
• A representation of trees by languages. II
• IO and OI. I
• IO and OI. II
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Automata, logics, and infinite games. A guide to current research
• Language equations
• Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms
• The power of commuting with finite sets of words
• Pushdown tree automata
• Decidability of Second-Order Theories and Automata on Infinite Trees
• The HOM Problem is EXPTIME-Complete

This page was built for publication: