Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable

[1]  Björn Borchardt,et al.  A Pumping Lemma and Decidability Problems for Recognizable Tree Series , 2004, Acta Cybern..

[2]  Peter Kostolányi.  On deterministic weighted automata , 2018, Inf. Process. Lett..

[3]  A. Salomaa.  Wechler, W., The Concept of Fuzziness in Automata and Language Theory. Studien zur Algebra und ihre Anwendungen 5. Berlin, Akademie‐Verlag 1978. 148 S., M 27,– , 1980 .

[4]  Zoltán Fülöp,et al.  Bounds for Tree Automata with Polynomial Costs , 2005, J. Autom. Lang. Comb..

[5]  Zoltán Ésik,et al.  Fuzzy tree automata , 2007, Fuzzy Sets Syst..

[6]  Symeon Bozapalidis,et al.  Weighted Grammars and Kleene's Theorem , 1987, Inf. Process. Lett..

[7]  Zoltán Fülöp,et al.  A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids , 2010, Theory of Computing Systems.

[8]  Heiko Vogler,et al.  Crisp-determinization of weighted tree automata over strong bimonoids , 2019, ArXiv.

[9]  Erik Paul.  Finite Sequentiality of Unambiguous Max-Plus Tree Automata , 2019, STACS.

[10]  Ines Klimann,et al.  Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton , 2004, Theor. Comput. Sci..

[11]  Daniel Kirsten,et al.  On the Determinization of Weighted Automata , 2005, J. Autom. Lang. Comb..

[12]  Manfred Droste,et al.  Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics , 2011, Algebraic Foundations in Computer Science.

[13]  Helmut Seidl.  Finite Tree Automata with Cost Functions , 1994, Theor. Comput. Sci..

[14]  Manfred Droste,et al.  Weighted automata and weighted MSO logics for average and long-time behaviors , 2012, Inf. Comput..

[15]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[16]  Manfred Droste,et al.  Weighted automata and multi-valued logics over arbitrary bounded lattices , 2012, Theor. Comput. Sci..

[17]  Heiko Vogler,et al.  Cut sets as recognizable tree languages , 2006, Fuzzy Sets Syst..

[18]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[19]  Heiko Vogler,et al.  Determinization of Finite State Weighted Tree Automata , 2003, J. Autom. Lang. Comb..

[20]  Zoltán Fülöp,et al.  A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids , 2007, Theory of Computing Systems.

[21]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .

[22]  Manfred Droste,et al.  Determinization of weighted finite automata over strong bimonoids , 2010, Inf. Sci..

[23]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[24]  H. Vogler,et al.  Weighted Tree Automata and Tree Transducers , 2009 .

[25]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[26]  Jean Berstel,et al.  Recognizable Formal Power Series on Trees , 1982, Theor. Comput. Sci..

[27]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.

[28]  Heiko Vogler,et al.  Determinization of Weighted Tree Automata Using Factorizations , 2010, J. Autom. Lang. Comb..

[29]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[30]  Imre Simon,et al.  On Finite Semigroups of Matrices , 1977, Theor. Comput. Sci..

[31]  Manfred Droste,et al.  Weighted finite automata over strong bimonoids , 2010, Inf. Sci..