You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Sets generated by stochastic automata of Markov’s chain type

Article type: Research Article

Authors: Janicki, Sławomir

Affiliations: Technical University of Lublin

Abstract: In the earlier paper of the author [2] it has been introduced the concept of the generability for stochastic automaton. Here we give new necessary and sufficient conditions for the generability of the set of infinite sequences of automaton states. Moreover, we consider the generability of subset, complement, union, intersection and difference of generable sets.

Keywords: stochastio automaton, probability measure, oarrier, word, language, generability, generable set

DOI: 10.3233/FI-1980-3404

Journal: Fundamenta Informaticae, vol. 3, no. 4, pp. 433-444, 1980

Received 5 July 1978
|
Published: 1 October 1980
Price: EUR 27.50
Show more