scientific article; zbMATH DE number 7407790

MaRDI QIDQ5155680

Doron Tiferet, Unnamed Author

Publication date: 8 October 2021

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

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

zbMATH Keywords

regular tree languagesautomata ambiguityparity tree automata

Mathematics Subject Classification ID

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

Cites Work

• Choice functions and well-orderings over the infinite binary tree
• Rational \(\omega\)-languages are non-ambiguous
• Succinct representation of regular languages by Boolean automata
• Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
• 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
• Ambiguity, Nondeterminism and State Complexity of Finite Automata
• Unambiguity in Automata Theory
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees
• DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: