Learning stochastic regular grammars by means of a state merging method
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Simulation of stochastic regular grammars through simple recurrent networksPublished by Springer Nature ,1993
- Induction of Finite-State Languages Using Second-Order Recurrent NetworksNeural Computation, 1992
- Learning and Extracting Finite State Automata with Second-Order Recurrent Neural NetworksNeural Computation, 1992
- INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIMEPublished by World Scientific Pub Co Pte Ltd ,1992
- LEARNING SEQUENTIAL STRUCTURE WITH THE REAL-TIME RECURRENT LEARNING ALGORITHMInternational Journal of Neural Systems, 1989
- On the inference of stochastic regular grammarsInformation and Control, 1978
- Complexity of automaton identification from given dataInformation and Control, 1978
- Inference of Finite-State Probabilistic GrammarsIEEE Transactions on Computers, 1977
- Implicit learning of artificial grammarsJournal of Verbal Learning and Verbal Behavior, 1967
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963