It is known that nonregular languages can be accepted by finite state probabilistic automata. For many years it was not known whether a finite state probabilistic automaton existed that would accept a context sensitive language that is not context free. Such a finite state probabilistic automaton is constructed
Probabilistic finite-state machines are used today in a variety of areas in pattern recognition, or ...
Paz 1967defines ε-approximation of probabilistic finite acceptors (p.ac.) and proves that the class ...
Probabilistic finite-state machines are used today in a variety of areas in pattern recognition, or ...
It is known that nonregular languages can be accepted by finite state probabilistic automata. For ma...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
A linear context-free language which is not acceptable by a finite probabilistic automaton is given,...
Abstract. We consider probabilistic automata over finite words. Such an au-tomaton defines the langu...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
It is quite natural to assign probabilities (or frequencies) to the sentences of a language to try t...
We explore language semantics for automata combining probabilistic and nondeterministic behaviors. W...
Several mathematical distances between probabilistic languages have been inves-tigated in the litera...
We study finite automata with both nondeterministic and random states (npfa's). We restrict our...
Several mathematical distances between probabilistic languages have been investigated in the literat...
The class of mod-p linear probabilistic automata are defined. It is shown that mod-2 linear probabil...
Probabilistic ω-automata are variants of nondeterministic automata over infinite words where all cho...
Probabilistic finite-state machines are used today in a variety of areas in pattern recognition, or ...
Paz 1967defines ε-approximation of probabilistic finite acceptors (p.ac.) and proves that the class ...
Probabilistic finite-state machines are used today in a variety of areas in pattern recognition, or ...
It is known that nonregular languages can be accepted by finite state probabilistic automata. For ma...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
A linear context-free language which is not acceptable by a finite probabilistic automaton is given,...
Abstract. We consider probabilistic automata over finite words. Such an au-tomaton defines the langu...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
It is quite natural to assign probabilities (or frequencies) to the sentences of a language to try t...
We explore language semantics for automata combining probabilistic and nondeterministic behaviors. W...
Several mathematical distances between probabilistic languages have been inves-tigated in the litera...
We study finite automata with both nondeterministic and random states (npfa's). We restrict our...
Several mathematical distances between probabilistic languages have been investigated in the literat...
The class of mod-p linear probabilistic automata are defined. It is shown that mod-2 linear probabil...
Probabilistic ω-automata are variants of nondeterministic automata over infinite words where all cho...
Probabilistic finite-state machines are used today in a variety of areas in pattern recognition, or ...
Paz 1967defines ε-approximation of probabilistic finite acceptors (p.ac.) and proves that the class ...
Probabilistic finite-state machines are used today in a variety of areas in pattern recognition, or ...
DOI
Add to ORKG