Learning Probability Distributions Generated by Finite-State Machines
From MaRDI portal
Publication:2963596
DOI10.1007/978-3-662-48395-4_5zbMath1404.68057OpenAlexW2480820881MaRDI QIDQ2963596
Ricard Gavaldà, Jorge E. Castro
Publication date: 15 February 2017
Published in: Topics in Grammatical Inference (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/100347
Related Items
Cites Work
- Unnamed Item
- The power of amnesia: Learning probabilistic automata with variable memory length
- On the computational complexity of approximating distributions by probabilistic automata
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- Realizations by stochastic finite automata
- On the definition of a family of automata
- A theory of the learnable
- Learning deterministic regular grammars from stochastic samples in polynomial time
- Learning functions represented as multiplicity automata
- Language identification in the limit