Abstract
AbstractWe show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A max-plus tree automaton is a weighted tree automaton over the max-plus semiring. A max-plus tree automaton is called finitely ambiguous if the number of accepting runs on every tree is bounded by a global constant. The finite sequentiality problem asks whether for a given max-plus tree automaton, there exist finitely many deterministic max-plus tree automata whose pointwise maximum is equivalent to the given automaton.
Funder
Deutsche Forschungsgemeinschaft
Universität Leipzig
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference53 articles.
1. Schützenberger, M.-P.: On the definition of a family of automata. Inf. Control. 4(2-3), 245–270 (1961)
2. Salomaa, A., Soittola, M.: Automata-theoretic aspects of formal power series, Texts and Monographs in Computer Science. Springer (1978)
3. Kuich, W., Salomaa, A.: Semirings, automata, languages, vol. 5. EATCS Monographs in Theoretical Computer Science. Springer (1986)
4. Berstel, J., Reutenauer, C.: Rational series and their languages, EATCS Monographs in Theoretical Computer Science, vol 12. Springer (1988)
5. Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of weighted automata, EATCS Monographs in Theoretical Computer Science. Springer, Berlin (2009)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献