Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Theoretical Computer Science - Developments in language theory
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
The Theory of Stabilisation Monoids and Regular Cost Functions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
How to Tackle Integer Weighted Automata Positivity
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Component Simulation-based Substitutivity Managing QoS Aspects
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding the sequentiality of a finitely ambiguous max-plus automaton
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Component simulation-based substitutivity managing QoS and composition issues
Science of Computer Programming
Regular Functions and Cost Register Automata
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |