A mathematical formulation of probabilistic grammars, as well as the random languages generated by probabilistic grammars, is introduced. Various types of probabilistic grammars are considered. The relations between these grammars and the corresponding types of probabilistic automata are examined
We explore language semantics for automata combining probabilistic and nondeterministic behaviors. W...
Several mathematical distances between probabilistic languages have been investigated in the literat...
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They d...
A mathematical formulation of probabilistic grammars, as well as the random languages generated by p...
It is quite natural to assign probabilities (or frequencies) to the sentences of a language to try t...
Usually, probabilistic automata and probabilistic grammars have crisp symbols as inputs, which can b...
Abstract. We survey various notions of probabilistic automata and probabilistic bisimulation, accumu...
We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in ...
AbstractComputing in the traditional sense involves inputs with strings of numbers and symbols rathe...
The purpose of this paper is to define the framework within which empirical investigations of probab...
The class of mod-p linear probabilistic automata are defined. It is shown that mod-2 linear probabil...
Probabilistic grammars define a set of well-formed or grammatical linguistic structures, just as all...
Several mathematical distances between probabilistic languages have been inves-tigated in the litera...
Devices for the generation of languages, corresponding to the probabilistic recognition devices or p...
This article presents an overview of Probabilistic Automata (PA) and discrete Hidden Markov Models (...
We explore language semantics for automata combining probabilistic and nondeterministic behaviors. W...
Several mathematical distances between probabilistic languages have been investigated in the literat...
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They d...
A mathematical formulation of probabilistic grammars, as well as the random languages generated by p...
It is quite natural to assign probabilities (or frequencies) to the sentences of a language to try t...
Usually, probabilistic automata and probabilistic grammars have crisp symbols as inputs, which can b...
Abstract. We survey various notions of probabilistic automata and probabilistic bisimulation, accumu...
We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in ...
AbstractComputing in the traditional sense involves inputs with strings of numbers and symbols rathe...
The purpose of this paper is to define the framework within which empirical investigations of probab...
The class of mod-p linear probabilistic automata are defined. It is shown that mod-2 linear probabil...
Probabilistic grammars define a set of well-formed or grammatical linguistic structures, just as all...
Several mathematical distances between probabilistic languages have been inves-tigated in the litera...
Devices for the generation of languages, corresponding to the probabilistic recognition devices or p...
This article presents an overview of Probabilistic Automata (PA) and discrete Hidden Markov Models (...
We explore language semantics for automata combining probabilistic and nondeterministic behaviors. W...
Several mathematical distances between probabilistic languages have been investigated in the literat...
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They d...
DOI
Add to ORKG