A linear context-free language which is not acceptable by a finite probabilistic automaton is given, and it is shown that the family of stochastic languages is not closed under concatenation and homomorphism
Several mathematical distances between probabilistic languages have been investigated in the literat...
Two measures of nondeterminism are introduced and used for classification of context-free languages ...
Weinberg F, Nebel M. Extending Stochastic Context-Free Grammars for an Application in Bioinformatics...
The purpose of the paper is to prove that the family of languages accepted by finite probabilistic a...
It is known that nonregular languages can be accepted by finite state probabilistic automata. For ma...
Paz 1967defines ε-approximation of probabilistic finite acceptors (p.ac.) and proves that the class ...
We explore language semantics for automata combining probabilistic and nondeterministic behaviors. W...
Abstract. We consider probabilistic automata over finite words. Such an au-tomaton defines the langu...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
AbstractThis paper contains further study of the randomness properties of languages. The connection ...
The class of mod-p linear probabilistic automata are defined. It is shown that mod-2 linear probabil...
Several mathematical distances between probabilistic languages have been inves-tigated in the litera...
The containment problem for quantitative automata is the natural quantitative generalisation of the ...
AbstractWe analyze the properties of probabilistic reversible decide-and-halt automata (DH-PRA) and ...
The information theoretical concept of the entropy (channel capacity) of context-free languages and ...
Several mathematical distances between probabilistic languages have been investigated in the literat...
Two measures of nondeterminism are introduced and used for classification of context-free languages ...
Weinberg F, Nebel M. Extending Stochastic Context-Free Grammars for an Application in Bioinformatics...
The purpose of the paper is to prove that the family of languages accepted by finite probabilistic a...
It is known that nonregular languages can be accepted by finite state probabilistic automata. For ma...
Paz 1967defines ε-approximation of probabilistic finite acceptors (p.ac.) and proves that the class ...
We explore language semantics for automata combining probabilistic and nondeterministic behaviors. W...
Abstract. We consider probabilistic automata over finite words. Such an au-tomaton defines the langu...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
AbstractThis paper contains further study of the randomness properties of languages. The connection ...
The class of mod-p linear probabilistic automata are defined. It is shown that mod-2 linear probabil...
Several mathematical distances between probabilistic languages have been inves-tigated in the litera...
The containment problem for quantitative automata is the natural quantitative generalisation of the ...
AbstractWe analyze the properties of probabilistic reversible decide-and-halt automata (DH-PRA) and ...
The information theoretical concept of the entropy (channel capacity) of context-free languages and ...
Several mathematical distances between probabilistic languages have been investigated in the literat...
Two measures of nondeterminism are introduced and used for classification of context-free languages ...
Weinberg F, Nebel M. Extending Stochastic Context-Free Grammars for an Application in Bioinformatics...
DOI
Add to ORKG