Robert Knast

Learn More
Let A be a finite alphabet and A* the free monoid generated by A. A language is any subset of A*. Assume that all the languages of the form {a}, where a is either the empty word or a letter in A, are given. Close this basic family of languages under Boolean operations; let So) be the resulting Boolean algebra of languages. Next, close #a) under(More)
~, ~ Stochastic operators (Definition 1.1) A, B, C, D Stochastic matrix operators (Definition 1.3) E Identity stochastic matrix operator As, B~., Ch, Dk ~Iatrices The probabilistic sequential machine (Definition 2.1) Distribution state of a probabilistic sequential machine (Definition 2.2) [A, B, C, D] The linear probabilistic sequential machine (Definition(More)
In many papers on probabilistic automata, representability of nonregular languages in these automata is considered. In Rabin [6] an example of a two-state probabilistic automaton in which nonregular languages can be represented was given. In the following years, on the basis of this automaton, a whole class of two-state probabilistic automata, so called(More)