Branching automata with costs: a way of reflecting parallelism in costs
Theoretical Computer Science - Implementation and application of automata
Weighted asynchronous cellular automata
Theoretical Computer Science
Skew and infinitary formal power series
Theoretical Computer Science
Weighted Distributed Systems and Their Logics
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
A Kleene Theorem for Forest Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Closures in Binary Partial Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Skew and infinitary formal power series
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Branching automata with costs: a way of reflecting parallelism in costs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Weighted and unweighted trace automata
Acta Cybernetica
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Weighted asynchronous cellular automata
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Valuations of weighted automata: doing it in a rational way
Algebraic Foundations in Computer Science
A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Towards cost-aware service recovery
Proceedings of the 9th international ACM Sigsoft conference on Quality of software architectures
| Hi-index | 0.00 |