Advertisement

Possibilities of probabilistic on-line counting machines

  • Farid. M. Ablaev
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)

Keywords

Regular Language Finite Alphabet Real Time Model Counting Machine Deterministic Automaton 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M.O. Rabin. Probabilistic automata, — Infermation and Control, 1963, v. 6, No. 3, p. 230–245.Google Scholar
  2. 2.
    R. Freivald. Capabilities of various models of probabilistic one-way automata, — Izvestija VUZ Mathematica, 1981, No. 5, p. 26–34, (in Russian).Google Scholar
  3. 3.
    F.M. Ablaev. Capabilities of probabilistic machines to represent languages in real time. — Izvestija VUZ Mathematica, 1985, No. 7, p. 32–40 (in Russian).Google Scholar
  4. 4.
    R. Freidzen. About one measure of complexity of recursive predicate. — Trudy Instituta Matematiki AN USSR, 1969, v. 113, p. 79–101 (in Russian).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Farid. M. Ablaev
    • 1
  1. 1.Department of Theoretical CyberneticsKazan State UniversityKazanUSSR

Personalised recommendations