Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Mathieu Tracol
Decidable Problems for Probabilistic Automata on Infinite Words
Related publications
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Survey on Decidable Equivalence Problems for Tree Transducers
International Journal of Foundations of Computer Science
Computer Science
Finite-State Automata on Infinite Inputs
Decidable Topologies for Communicating Automata With FIFO and Bag Channels
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Model Checking for Probabilistic Timed Automata
Formal Methods in System Design
Hardware
Theoretical Computer Science
Architecture
Software
Bounds on the Kolmogorov Complexity Function for Infinite Words
Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammars
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Decidability of Periodicity for Infinite Words
RAIRO - Theoretical Informatics and Applications
Mathematics
Computer Science Applications
Software
