Amanote Research

Amanote Research

    RegisterSign In

Learning Stochastic Finite Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-30195-0_16
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2004

Authors
Colin de la HigueraJose Oncina
Publisher

Springer Berlin Heidelberg


Related search

Learning Finite Automata Using Label Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

Some Remarks on the Extension of a Finite Set of Stochastic Automata

Applicationes Mathematicae
1975English

A Learning Automata Based Solution to Service Selection in Stochastic Environments

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Finite Time Analysis of the Pursuit Algorithm for Learning Automata

IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
1996English

A Novel Machine Translation Method Based on Stochastic Finite Automata Model for Spoken English

International Journal of Emerging Technologies in Learning
EngineeringEducationE-learning
2019English

Generalized Automata and Stochastic Languages

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1969English

Stochastic Machines and Probabilistic Automata.

English

On Finite Monoids of Cellular Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy