In this paper the necessary and sufficient conditions of representability of nonregular languages in finite probabilistic automata are formulated
Paz 1967defines ε-approximation of probabilistic finite acceptors (p.ac.) and proves that the class ...
We investigate unary regular languages and compare deterministic finite automata (DFA’s), nondetermi...
Probabilistic ω-automata are variants of nondeterministic automata over infinite words where all cho...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
Some properties of languages representable in finite probabilistic automata are investigated. It is ...
It is known that nonregular languages can be accepted by finite state probabilistic automata. For ma...
Abstract. We consider probabilistic automata over finite words. Such an au-tomaton defines the langu...
For semi-Thue systems the notion of probabilistic rule is introduced. Based on probabilistic rules, ...
We study finite automata with both nondeterministic and random states (npfa's). We restrict our...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
A short proof of the result concerning the regularity of events defined by m-adic probabilistic auto...
We investigate and compare the descriptional power of unary probabilistic and nondeterministic autom...
The purpose of the paper is to prove that the family of languages accepted by finite probabilistic a...
Probabilistic automata (p.a.) are a generalization of finite deterministic automata. We follow the f...
The class of mod-p linear probabilistic automata are defined. It is shown that mod-2 linear probabil...
Paz 1967defines ε-approximation of probabilistic finite acceptors (p.ac.) and proves that the class ...
We investigate unary regular languages and compare deterministic finite automata (DFA’s), nondetermi...
Probabilistic ω-automata are variants of nondeterministic automata over infinite words where all cho...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
Some properties of languages representable in finite probabilistic automata are investigated. It is ...
It is known that nonregular languages can be accepted by finite state probabilistic automata. For ma...
Abstract. We consider probabilistic automata over finite words. Such an au-tomaton defines the langu...
For semi-Thue systems the notion of probabilistic rule is introduced. Based on probabilistic rules, ...
We study finite automata with both nondeterministic and random states (npfa's). We restrict our...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
A short proof of the result concerning the regularity of events defined by m-adic probabilistic auto...
We investigate and compare the descriptional power of unary probabilistic and nondeterministic autom...
The purpose of the paper is to prove that the family of languages accepted by finite probabilistic a...
Probabilistic automata (p.a.) are a generalization of finite deterministic automata. We follow the f...
The class of mod-p linear probabilistic automata are defined. It is shown that mod-2 linear probabil...
Paz 1967defines ε-approximation of probabilistic finite acceptors (p.ac.) and proves that the class ...
We investigate unary regular languages and compare deterministic finite automata (DFA’s), nondetermi...
Probabilistic ω-automata are variants of nondeterministic automata over infinite words where all cho...
DOI
Add to ORKG