Probabilistic Automata on Finite Words: Decidable and Undecidable Problems

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-14162-1_44
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Decidable Problems for Probabilistic Automata on Infinite Words

2012English

Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

On the Complexity of Undecidable Problems in Automata Theory

1967English

Low Dimensional Hybrid Systems – Decidable, Undecidable, Donʼt Know

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2012English

Deciding Probabilistic Simulation Between Probabilistic Pushdown Automata and Finite-State Systems

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2019English

Decidable Topologies for Communicating Automata With FIFO and Bag Channels

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Stochastic Machines and Probabilistic Automata.

English

Errata to ‘‘Decision Problems of Finite Automata Design and Related Arithmetics”

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1962English

A Survey on Decidable Equivalence Problems for Tree Transducers

International Journal of Foundations of Computer Science
Computer Science
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy