Deciding equivalence of finite tree automata

DOI10.1007/BFb0029009zbMath1492.68081MaRDI QIDQ5096180

Helmut Seidl

Publication date: 16 August 2022

Published in: STACS 89 (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (4)

Haskell overloading is DEXPTIME-complete ⋮ Unnamed Item ⋮ Queries on XML streams with bounded delay and concurrency ⋮ Pushdown tree automata, algebraic tree systems, and algebraic tree series

Cites Work

• Tree acceptors and some of their applications
• Approximate formulas for some functions of prime numbers
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• Alternation
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deciding equivalence of finite tree automata