Reduction of nondeterministic tree automata

DOI10.1007/978-3-662-49674-9_46zbMath1420.68105arXiv1512.08823OpenAlexW2200478861MaRDI QIDQ2272933

Lukáš Holík, Ricardo Almeida, Richard Mayr

Publication date: 17 September 2019

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Minimization of Visibly Pushdown Automata Using Partial Max-SAT ⋮ TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS ⋮ A Congruence-Based Perspective on Finite Tree Automata

This page was built for publication: Reduction of nondeterministic tree automata