scientific article; zbMATH DE number 7376067

DOI10.4230/LIPIcs.ICALP.2018.140zbMath1499.68195arXiv1803.06163MaRDI QIDQ5002827

Michał Skrzypczak

Publication date: 28 July 2021

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

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

zbMATH Keywords

parity gamesinfinite treesunambiguous automataindex hierarchy

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

The containment problem for unambiguous register automata and unambiguous timed automata ⋮ The Containment Problem for Unambiguous Register Automata ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Choice functions and well-orderings over the infinite binary tree
• An automata theoretic decision procedure for the propositional mu- calculus
• Monadic second-order logic on tree-like structures
• Forms of Determinism for Automata (Invited Talk)
• Rabin's uniformization problem
• MSO on the Infinite Binary Tree: Choice and Order
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• Theμ-calculus alternation-depth hierarchy is strict on binary trees

This page was built for publication: