article · Vestnik St Petersburg University Mathematics · 2011

Finitely nonstationary nondeterministic automata with random input

Cited by 0Abstract and details only

Abstract

Properties of generalized finitely nonstationary nondeterministic automata with an additional random input over a Boolean lattice are considered which are related to the definition of the class of languages represented by such automaton models. New notions of an elementary nondeterministic automatic structure with a random input, of a generalized finitely nonstationary nondeterministic automaton with a random input, of the generalized mapping induced by such an automaton, and of a generalized language represented by such an automaton are introduced. A number of statements substantiating synthesis for any given generalized finitely nonstationary nondeterministic automaton with a random input of an abstract probabilistic finite automaton equivalent to the given one relative to the represented generalized language probabilistic language of the stationary abstract probabilistic finite automaton. The number of states of the synthesized probabilistic automaton is estimated and a synthesis algorithm is developed in detail and illustrated by an example.

Cite this paper

APA 7

Чирков, М. К., & Shevchenko, A. S. (2011). Finitely nonstationary nondeterministic automata with random input. Vestnik St Petersburg University Mathematics, 44(2), 155–165. https://doi.org/10.3103/s1063454111020051

MLA 9

Чирков, М. К., and A. S. Shevchenko. “Finitely nonstationary nondeterministic automata with random input.” Vestnik St Petersburg University Mathematics, vol. 44, no. 2, 2011, pp. 155–65, https://doi.org/10.3103/s1063454111020051.

Chicago

Чирков, М. К., and A. S. Shevchenko. 2011. “Finitely nonstationary nondeterministic automata with random input.” Vestnik St Petersburg University Mathematics 44 (2): 155–65. https://doi.org/10.3103/s1063454111020051.

Harvard

Чирков, М.К. and Shevchenko, A.S. (2011) ‘Finitely nonstationary nondeterministic automata with random input’, Vestnik St Petersburg University Mathematics, 44(2), pp. 155–165. Available at: https://doi.org/10.3103/s1063454111020051.

BibTeX

@article{anon2011finitely,
  title = {{Finitely nonstationary nondeterministic automata with random input}},
  author = {Чирков, М. К. and Shevchenko, A. S.},
  journal = {Vestnik St Petersburg University Mathematics},
  volume = {44},
  number = {2},
  pages = {155--165},
  year = {2011},
  doi = {10.3103/s1063454111020051}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.