Finite Sequentiality of Unambiguous Max-Plus Tree Automata-Reference-Cited by-同舟云学术

Finite Sequentiality of Unambiguous Max-Plus Tree Automata

Published:2021-03-26 Issue:4 Volume:65 Page:736-776
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Paul Erik^ORCID

Abstract

AbstractWe show the decidability of the finite sequentiality problem for unambiguous max-plus tree automata. A max-plus tree automaton is called unambiguous if there is at most one accepting run on every tree. 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

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00224-020-10021-w.pdf

Reference44 articles.

1. Alexandrakis, A., Bozapalidis, S.: Weighted grammars and Kleene’s theorem. Inf. Process. Lett. 24(1), 1–4 (1987)

2. Allauzen, C., Mohri, M.: Efficient algorithms for testing the twins property. J. Autom. Lang. Combin. 8(2), 117–144 (2003)

3. Bala, S.: Which finitely ambiguous automata recognize finitely sequential functions? In: Chatterjee, K., Sgall, J. (eds.) 38th International Symposium on Mathematical Foundations of Computer Science (MFCS). Springer, Lecture Notes in Computer Science, vol. 8087, pp. 86–97 (2013)

4. Bala, S., Koniński, A., Martín-Vide, C., Truthe, B.: Unambiguous automata denoting finitely sequential functions. In: Dediu, A. (ed.) 7th International Conference on Language and Automata Theory and Applications (LATA), Springer, Lecture Notes in Computer Science, vol. 7810, pp. 104–115 (2013)

5. Béal, M., Carton, O., Prieur, C., Sakarovitch, J.: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theor. Comput. Sci. 292(1), 45–63 (2003)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata;International Journal of Foundations of Computer Science;2023-06-17

3. Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields;Computer Science – Theory and Applications;2022