Rational series and their languages
Rational series and their languages
On the Computational Complexity of Approximating Distributions by Probabilistic Automata
Machine Learning - Computational learning theory
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning Probabilistic Residual Finite State Automata
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning Stochastic Regular Grammars by Means of a State Merging Method
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
Learning regular languages using RFSAs
Theoretical Computer Science - Special issue: Algorithmic learning theory
Residual Finite State Automata
Fundamenta Informaticae
Learning rational stochastic languages
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Using pseudo-stochastic rational languages in probabilistic grammatical inference
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Survey A survey of computational complexity results in systems and control
Automatica (Journal of IFAC)
Absolute Convergence of Rational Series Is Semi-decidable
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Grammatical inference as a principal component analysis problem
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
A spectral approach for probabilistic grammatical inference on trees
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Absolute convergence of rational series is semi-decidable
Information and Computation
| Hi-index | 0.00 |
The goal of the present paper is to provide a study of rational stochastic languages over a semiring K ∈ {Q,R,Q$^+$,R$^+$}. A rational stochastic language is a probability distribution over a free monoid Σ*, which is rational over K, that is, which can be generated by a multiplicity automaton with parameters in K. We study the relations between the classes of rational stochastic languages S$^{rat}$$_K$(Σ). We define the notion of residual language of a stochastic language and we use it to investigate properties of several subclasses of rational stochastic languages. Then, we study the representation of rational stochastic languages by means of multiplicity automata. Lastly, we show some connections between properties of rational stochastic languages and results obtained in the field of probabilistic grammatical inference.