Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Rabin M. O.: "Probabilistic automata", Inform. and Control 6 (1963), 230–245.
Rabin M. O.: "Lectures on classical and probabilistic automata", in Automata Theory (E. R. Caianiello, ed.), Academic Press, New York (1966).
Lorenz A. A.: Stochastic Automata — Constructive Theory, Halsted Press — Wiley, New York (1974).
Podnieks K. M.: "On cut-points of some finite stochastic automata", Avtomat. i Vychisl. Tekhn. 5 (1970) (Russian).
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).
Bertoni A.: "The solution to problems relative to probabilistic automata in the frame of the formal languages theory", in GI 4. Jahrestagung (G. Goos and J. Hartmanis eds.), Springer Verlag, Berlin-Heidelberg-New York (1975), 107–112.
Paz A.: "Some aspects of probabilistic automata", Inform. and Control 9 (1966), 26–60.
Salomaa A.: "On m-adic probabilistic automata", Inform. and Control 10 (1967), 215–219.
Paz A.: Introduction to Probabilistic Automata, Academic Press, New York-London (1971).
Hopcroft J. E., J. D. Ullman: Formal Languages and Their Relation to Automata, Addison-Wesley, Reading (1969).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertoni, A., Mauri, G., Torelli, M. (1977). Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_7
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive