From post

A Nivat Theorem for Quantitative Automata on Unranked Trees.

, и . Models, Algorithms, Logics and Tools, том 10460 из Lecture Notes in Computer Science, стр. 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.

 

Другие публикации лиц с тем же именем

Conway and iteration hemirings Part 1., , и . Int. J. Algebra Comput., 24 (4): 461-482 (2014)Editorial., и . Journal of Automata, Languages and Combinatorics, 12 (4): 433 (2007)Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics., , и . CAI, том 9270 из Lecture Notes in Computer Science, стр. 90-102. Springer, (2015)Universal Homogeneous Graph-Like Structures And Domains., , и . Math. Struct. Comput. Sci., 12 (1): 91-109 (2002)Conway and iteration hemirings., , и . CoRR, (2013)Construction of Some Uncountable 2-Arc-Transitive Bipartite Graphs., , и . Order, 25 (4): 349-357 (2008)Aperiodic Languages over Concurrency Monoids. preprint, TU Dresden, (мая 1994)Weighted Nested Word Automata and Logics over Strong bimonoids., и . Int. J. Found. Comput. Sci., 25 (5): 641- (2014)The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free Languages., и . Int. J. Found. Comput. Sci., 25 (8): 955-970 (2014)Weighted automata and logics for infinite nested words., и . Inf. Comput., (2017)