Bottom-up and top-down tree series transformations
Journal of Automata, Languages and Combinatorics
Least and greatest solutions of equations over N
Nordic Journal of Computing
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Journal of Automata, Languages and Combinatorics
Decidable first-order transition logics for PA-processes
Information and Computation
Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
Theoretical Computer Science
Weighted tree automata and weighted logics
Theoretical Computer Science
Incomparability results for classes of polynomial tree series transformations
Journal of Automata, Languages and Combinatorics
Automata-Based Axiom Pinpointing
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
Cut sets as recognizable tree languages
Fuzzy Sets and Systems
Decidable first-order transition logics for PA-processes
Information and Computation
The myhill-nerode theorem for recognizable tree series
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Recognizable tree series with discounting
Acta Cybernetica
Determinization of weighted finite automata over strong bimonoids
Information Sciences: an International Journal
Automata-Based Axiom Pinpointing
Journal of Automated Reasoning
Weighted muller tree automata and weighted logics
Journal of Automata, Languages and Combinatorics
Does o-substitution preserve recognizability?
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Weighted tree automata over valuation monoids and their characterization by weighted logics
Algebraic Foundations in Computer Science
Visibly pushdown automata with multiplicities: finiteness and k-boundedness
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
| Hi-index | 0.00 |