Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata-Reference-Cited by-同舟云学术

Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata

Published:1977 Issue: Volume: Page:87-94
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Bertoni A.,Mauri G.,Torelli M.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-08342-1_7.pdf

Reference10 articles.

1. Rabin M. O.: "Probabilistic automata", Inform. and Control 6 (1963), 230–245.

2. Rabin M. O.: "Lectures on classical and probabilistic automata", in Automata Theory (E. R. Caianiello, ed.), Academic Press, New York (1966).

3. Lorenz A. A.: Stochastic Automata — Constructive Theory, Halsted Press — Wiley, New York (1974).

4. Podnieks K. M.: "On cut-points of some finite stochastic automata", Avtomat. i Vychisl. Tekhn. 5 (1970) (Russian).

5. Metra I. A., A. A. Smilgais: "On some possibilities of representation of nonregular events by stochastic automata", in Latviiskii matematicheskii ezhegodnik 3, Riga, Zinatne (1968) (Russian).

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases;Language and Automata Theory and Applications;2020

2. Undecidability results for probabilistic automata;ACM SIGLOG News;2017-11-03

3. Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes;SOFSEM 2014: Theory and Practice of Computer Science;2014

4. Two Recursively Inseparable Problems for Probabilistic Automata;Mathematical Foundations of Computer Science 2014;2014

5. Probabilistic Automata with Isolated Cut-Points;Mathematical Foundations of Computer Science 2013;2013