Author of the publication

A Nivat Theorem for Quantitative Automata on Unranked Trees.

, and . Models, Algorithms, Logics and Tools, volume 10460 of Lecture Notes in Computer Science, page 22-35. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Normal Subgroups of B u Aut(Omega)., and . Appl. Categorical Struct., 15 (1-2): 153-162 (2007)Preface., , and . Theor. Comput. Sci., (2019)Multi-weighted Automata and MSO Logic., and . Theory Comput. Syst., 59 (2): 231-261 (2016)The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages, and . CoRR, (2012)A Nivat Theorem for Quantitative Automata on Unranked Trees., and . Models, Algorithms, Logics and Tools, volume 10460 of Lecture Notes in Computer Science, page 22-35. Springer, (2017)Effectively Given Information Systems and Domains., and . CSL, volume 440 of Lecture Notes in Computer Science, page 116-142. Springer, (1989)From Domains to Automata with Concurrency., and . ICALP, volume 700 of Lecture Notes in Computer Science, page 669-681. Springer, (1993)Weighted Automata and Weighted Logics on Infinite Words., and . Developments in Language Theory, volume 4036 of Lecture Notes in Computer Science, page 49-58. Springer, (2006)Determinization of weighted finite automata over strong bimonoids., , , and . Inf. Sci., 180 (18): 3497-3520 (2010)Universal Domains and the Amalgamation Property., and . Math. Struct. Comput. Sci., 3 (2): 137-159 (1993)