DOIAbstract
In this paper the necessary and sufficient conditions of representability of nonregular languages in finite probabilistic automata are formulated
In this paper the necessary and sufficient conditions of representability of nonregular languages in finite probabilistic automata are formulated
A linear context-free language which is not acceptable by a finite probabilistic automaton is given,...
A mathematical formulation of probabilistic grammars, as well as the random languages generated by p...
Probabilistic B\"uchi Automata (PBA) are randomized, finite state automatathat process input strings...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
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...
We explore language semantics for automata combining probabilistic and nondeterministic behaviors. W...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
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 study finite automata with both nondeterministic and random states (npfa's). We restrict our...
We investigate and compare the descriptional power of unary probabilistic and nondeterministic autom...
The containment problem for quantitative automata is the natural quantitative generalisation of the ...
We consider the computability and complexity of decision questions for Probabilistic Finite Automata...
We consider the computability and complexity of decision questions for Probabilistic Finite Automata...
A linear context-free language which is not acceptable by a finite probabilistic automaton is given,...
A mathematical formulation of probabilistic grammars, as well as the random languages generated by p...
Probabilistic B\"uchi Automata (PBA) are randomized, finite state automatathat process input strings...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
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...
We explore language semantics for automata combining probabilistic and nondeterministic behaviors. W...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
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 study finite automata with both nondeterministic and random states (npfa's). We restrict our...
We investigate and compare the descriptional power of unary probabilistic and nondeterministic autom...
The containment problem for quantitative automata is the natural quantitative generalisation of the ...
We consider the computability and complexity of decision questions for Probabilistic Finite Automata...
We consider the computability and complexity of decision questions for Probabilistic Finite Automata...
A linear context-free language which is not acceptable by a finite probabilistic automaton is given,...
A mathematical formulation of probabilistic grammars, as well as the random languages generated by p...
Probabilistic B\"uchi Automata (PBA) are randomized, finite state automatathat process input strings...
Add to ORKG