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
A probabilistic Chomsky–Schützenberger hierarchy of grammars is introduced and studied, with the aim...
Abstract. We survey various notions of probabilistic automata and probabilistic bisimulation, accumu...
We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in ...
A mathematical formulation of probabilistic grammars, as well as the random languages generated by p...
Devices for the generation of languages, corresponding to the probabilistic recognition devices or p...
For semi-Thue systems the notion of probabilistic rule is introduced. Based on probabilistic rules, ...
It is quite natural to assign probabilities (or frequencies) to the sentences of a language to try t...
AbstractComputing in the traditional sense involves inputs with strings of numbers and symbols rathe...
Some properties of languages representable in finite probabilistic automata are investigated. It is ...
International audienceWe provide a Kleene Theorem for (Rabin) probabilistic automata over finite wor...
Probabilistic ω-automata are variants of nondeterministic automata over infinite words where all cho...
Probabilistic grammars acting as information sources are considered and concepts from information th...
The purpose of this paper is to briefly examine two proposed extensions of statistical/probabilistic...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
Usually, probabilistic automata and probabilistic grammars have crisp symbols as inputs, which can b...
A probabilistic Chomsky–Schützenberger hierarchy of grammars is introduced and studied, with the aim...
Abstract. We survey various notions of probabilistic automata and probabilistic bisimulation, accumu...
We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in ...
A mathematical formulation of probabilistic grammars, as well as the random languages generated by p...
Devices for the generation of languages, corresponding to the probabilistic recognition devices or p...
For semi-Thue systems the notion of probabilistic rule is introduced. Based on probabilistic rules, ...
It is quite natural to assign probabilities (or frequencies) to the sentences of a language to try t...
AbstractComputing in the traditional sense involves inputs with strings of numbers and symbols rathe...
Some properties of languages representable in finite probabilistic automata are investigated. It is ...
International audienceWe provide a Kleene Theorem for (Rabin) probabilistic automata over finite wor...
Probabilistic ω-automata are variants of nondeterministic automata over infinite words where all cho...
Probabilistic grammars acting as information sources are considered and concepts from information th...
The purpose of this paper is to briefly examine two proposed extensions of statistical/probabilistic...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
Usually, probabilistic automata and probabilistic grammars have crisp symbols as inputs, which can b...
A probabilistic Chomsky–Schützenberger hierarchy of grammars is introduced and studied, with the aim...
Abstract. We survey various notions of probabilistic automata and probabilistic bisimulation, accumu...
We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in ...
DOI
Add to ORKG