Permutations and Control Sets for Learning Non-regular Language Families-Reference-Cited by-同舟云学术

Permutations and Control Sets for Learning Non-regular Language Families

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

Author:

Fernau Henning,Sempere José M.

Publisher

Springer Berlin Heidelberg

Link

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

Reference37 articles.

1. Ahonen, H.: Generating grammars for structured documents using grammatical inference methods. Phd thesis. Also: Report A-1996-4, Department of Computer Science, University of Helsinki, Finland (1996)

2. Amar, V., Putzolu, G.: On a family of linear grammars. Information and Control 7, 283–291 (1964)

3. Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)

4. Angluin, D.: Inference of reversible languages. Journal of the Association for Computing Machinery 29(3), 741–765 (1982)

5. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75, 87–106 (1987)

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

1. On deterministic sensing $$5'\rightarrow 3'$$ Watson–Crick finite automata: a full hierarchy in 2detLIN;Acta Informatica;2020-01-06

2. Scanning Pictures the Boustrophedon Way;Lecture Notes in Computer Science;2015

3. Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG;Grammatical Inference: Theoretical Results and Applications;2010

4. Fragmentation: Enhancing Identifiability;Grammatical Inference: Algorithms and Applications;2002

5. Learning XML Grammars;Machine Learning and Data Mining in Pattern Recognition;2001