Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Methodology of proving a finite-state stochastic representability and nonrepresentability

  • Section A Algebraic & Constructive Theory of Machines, Computations and Languages
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 56))

Included in the following conference series:

  • 324 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. R.G.Bukharajev, Criteria for representability of events in finite probabilistic automata. Dokl.Akad.Nauk SSSR, 1964(1965)

    Google Scholar 

  2. P.Turakainen, Generalized automata and stochastic languages. Proc.Amer.Soc., 21 (1969)

    Google Scholar 

  3. M.Nasu and N.Honda, A context-free language which is not acceptable by a probabilistic automaton. Inf. and Control 18 (1971)

    Google Scholar 

  4. A.Paz, Formal series, finiteness properties and decision problems. Ann.Acad.Sci.Fenn.Ser.A1 No493 (1971)

    Google Scholar 

  5. Phan Dinh Dieu, On a necessary condition for stochastic languages. EIK, 8 (1972)

    Google Scholar 

  6. Ja.K.Lapin's, Nonstochastic languages that can be obtained as a union or intersection of stochastic languages. Avtomat. i Vycisl. Tecn. (Riga), No 4(1974)

    Google Scholar 

  7. V.M.Gluskov, Abstract theory of automata. Uspehi Mat.Nauk,16, no 5 (101) (1961)

    Google Scholar 

  8. M.P.Schützenberger, On the definition of a family of automata. Inf. and Control, 4 (1961)

    Google Scholar 

  9. J.W.Carlyle and A.Paz, Realizations by a stochastic finite automata. J.Comput.System Sci. 5 (1971)

    Google Scholar 

  10. A.A.Mucnik and A.N.Maslov, Regular, linear and probabilistic events. Trudy Mat.Inst.Steklov. 133 (1973)

    Google Scholar 

  11. R.G.Bukharajev, The theory of abstract probabilistic automata. Problemy cibernetiki, v.30(1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of mathematics and mechanics, Kazan State University, Lenin st,18, 420008, Kazan, USSR

    R. G. Bukharajev & Ju. A. Alpin

Authors
  1. R. G. Bukharajev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ju. A. Alpin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bukharajev, R.G., Alpin, J.A. (1977). Methodology of proving a finite-state stochastic representability and nonrepresentability. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_64

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_64

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08442-6

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation