Decidable Problems for Probabilistic Automata on Infinite Words

doi 10.1109/lics.2012.29
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Probabilistic Automata on Finite Words: Decidable and Undecidable Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

A Survey on Decidable Equivalence Problems for Tree Transducers

International Journal of Foundations of Computer Science
Computer Science
2015English

Finite-State Automata on Infinite Inputs

2012English

Decidable Topologies for Communicating Automata With FIFO and Bag Channels

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Model Checking for Probabilistic Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2012English

Bounds on the Kolmogorov Complexity Function for Infinite Words

2016English

Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammars

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1989English

Decidability of Periodicity for Infinite Words

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1986English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy