Minimisation of Multiplicity Tree Automata
From MaRDI portal
Publication:2949446
DOI10.1007/978-3-662-46678-0_19zbMath1459.68103arXiv1410.5352OpenAlexW1797209310MaRDI QIDQ2949446
Stefan Kiefer, Ines Marusic, James Worrell
Publication date: 1 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.5352
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- The rank of a formal tree power series
- Hilbert's tenth problem for fields of rational functions over finite fields
- Effective construction of the syntactic algebra of a recognizable series on trees
- Minimizing deterministic weighted tree automata
- Recognizable formal power series on trees
- The parallel complexity of finite-state automata problems
- A probabilistic remark on algebraic program testing
- Realizations by stochastic finite automata
- Complexity of Equivalence and Learning for Multiplicity Tree Automata
- Représentations matricielles des séries d'arbre reconnaissables
- Deciding Equivalence of Finite Tree Automata
- An Implementation of Deterministic Tree Automata Minimization
- Learning Multiplicity Tree Automata
- On the Complexity of Numerical Analysis
- A taxonomy of problems with fast parallel algorithms
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- Fast Parallel Matrix Inversion Algorithms
- Complexity of automaton identification from given data
- Minimal NFA Problems are Hard
- On the Complexity of Equivalence and Minimisation for Q-weighted Automata
- Stability and Complexity of Minimising Probabilistic Automata
- Computational Complexity
- The minimalization of tree automata
- On the Computation of Some Standard Distances Between Probabilistic Automata
This page was built for publication: Minimisation of Multiplicity Tree Automata
