Learning Regular Languages Using Non Deterministic Finite Automata-Reference-Cited by-同舟云学术

Learning Regular Languages Using Non Deterministic Finite Automata

Published:2000 Issue: Volume: Page:39-50
ISSN:0302-9743
Container-title:Grammatical Inference: Algorithms and Applications
language:
Short-container-title:

Author:

Denis François,Lemay Aurélien,Terlutte Alain

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-45257-7_4

Reference10 articles.

1. Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using non deterministic finite automata. Technical Report 7 (2000)

2. Denis, F., Lemay, A., Terlutt, A.: Les automates finis à états résiduels (afer). Technical report (2000), ftp://ftp.grappa.univliller3.fr/pub/reports/after.ps.gz

3. Goldman, S.A., Mathias, H.D.: Teaching a smarter learner. Journal of Computer and System Sciences 52(2), 255–267 (1996)

4. Gold, E.M.: Complexity of automaton identification from given data. Inform. Control 37, 302–320 (1978)

5. De La Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning 27, 125–137 (1997)

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning Patterns in Configuration;2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE);2021-11

2. Model learning: a survey of foundations, tools and applications;Frontiers of Computer Science;2021-06-29

3. On the Inference of Finite State Automata from Positive and Negative Data;Topics in Grammatical Inference;2016

4. Software model synthesis using satisfiability solvers;Empirical Software Engineering;2012-08-09

5. A randomised inference algorithm for regular tree languages;Natural Language Engineering;2011-03-21