Permutations and control sets for learning non-regular language families

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1891, Issue , 2000, Pages 75-88

  Fernau, Henning ^a   Sempere, José M ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Control sets; Formal languages; Learning from positive data; Universal grammars

Indexed keywords

COMPUTATIONAL GRAMMARS; FORMAL LANGUAGES;

CONTROL SET; GRAMMAR INFERENCE; LEARNING PARADIGMS; NON-REGULAR LANGUAGES; POSITIVE DATA; QUERY LEARNING; UNIVERSAL GRAMMAR; VERSATILE METHODS;

INFERENCE ENGINES;

EID: 84974695976     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45257-7_7     Document Type: Conference Paper

References (37)

1. H. Ahonen. 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. V. Amar and G. Putzolu. On a family of linear grammars. Information and Control, 7:283-291, 1964.
3. D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117-135, 1980.
4. D. Angluin. Inference of reversible languages. Journal of the Association for Computing Machinery, 29(3):741-765, 1982.
5. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987.
6. J. Berstel. Transductions and Context-Free Languages, volume 38 of LAMM. Stuttgart: Teubner, 1979.
7. J. A. Brzozowski. Regular-like expressions for some irregular languages. In IEEE Conf. Record of 9th Ann. Symp. on Switching and Automata Theory SWAT, pages 278-280, 1968.
8. J. Dassow and Gh. Păun. Regulated Rewriting in Formal Language Theory, volume 18 of EATCS Monographs in Theoretical Computer Science. Berlin: Springer, 1989.
9. H. Fernau. Efficient learning of some linear matrix languages. In T. Asano et al., editors, COCOON’99, volume 1627 of LNCS, pages 221-230, 1999.
10. H. Fernau. Learning of terminal distinguishable languages. Technical Report WSI-99-23, Universität Tübingen (Germany), Wilhelm-Schickard-Institut für Informatik, 1999. Short version published in the proceedings of AMAI 2000, see http://rutcor.rutgers.edu/~amai/AcceptedCont.htm
11. H. Fernau. fc-gram extensions of terminal distinguishable languages. In Proc. International Conference on Pattern Recognition. IEEE/IAPR, 2000. To appear.
12. H. Fernau. PC grammar systems with terminal transmission. In Proc. International Workshop on Grammar Systems, 2000. To appear.
13. H. Fernau and M. Holzer. External contextual and conditional languages. To appear in a book edited by Gh. Păun, 1999.
14. P. García et al. On the use of the morphic generator grammatical inference (MGGI) methodology in automatic speech recognition. International Journal of Pattern Recognition and Artificial Intelligence, 4:667-685, 1990.
15. P. García and E. Vidal. Inference of fc-testable languages in the strict sense and applications to syntactic pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12:920-925, 1990.
16. P. García, E. Vidal, and F. Casacuberta. Local languages, the successor method, and a step towards a general methodology for the inference of regular grammars. IEEE Transactions on Pattern Analysis and Machine Intelligence, 9:841-845, 1987.
17. P. García, E. Vidal, and J. Oncina. Learning locally testable languages in the strict sense. In First International Workshop on Algorithmic Learning Theory ALT’90, pages 325-328, 1990.
18. E. M. Gold. Language identification in the limit. Information and Control, 10:447474, 1967.
19. J. Gregor. Data-driven inductive inference of finite-state automata. International Journal of Pattern Recognition and Artificial Intelligence, 8(1):305-322, 1994.
20. S. A. Greibach. Control sets on context-free grammar forms. Journal of Computer and System Sciences, 15:35-98, 1977.
21. T. Head, S. Kobayashi, and T. Yokomori. Locality, reversibility, and beyond: Learning languages from positive data. In ALT’98, volume 1537 of LNCS, pages 191-204, 1998.
22. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Reading (MA): Addison-Wesley, 1979.
23. E. Makinen. The grammatical inference problem for the Szilard languages of linear grammars. Information Processing Letters, 36:203-206, 1990.
24. E. Mäkinen. A note on the grammatical inference problem for even linear languages. Fundamenta Informaticae, 25:175-181, 1996.
25. H. A. Maurer and W. Kuich. Tuple languages. In W. D. Itzfeld, editor, Proc. of the ACM International Computing Symposium, pages 882-891. German Chapter of the ACM, 1970.
26. T. Y. Medvedev. On the class of events representable in a finite automaton (translated from russian). In E. F. Moore, editor, Sequential Machines - Selected papers, pages 227-315. Addison-Wesley, 1964.
27. M. Nivat. Transductions des langages de Chomsky. Ann. Inst. Fourier, Grenoble, 18:339-456, 1968.
28. Gh. Păun. Marcus contextual grammar. Studies in Linguistics and Philosophy. Dordrecht: Kluwer Academic Publishers, 1997.
29. Gh. Păun. Linear simple matrix languages. Elektronische Informationsverarbeitung und Kybernetik (jetzt J. Inf. Process. Cybern. EIK), 14:377-384, 1978.
30. V. Radhakrishnan. Grammatical Inference from Positive Data: An Effective Integrated Approach. PhD thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Bombay (India), 1987.
31. V. Radhakrishnan and G. Nagaraja. Inference of regular grammars via skeletons. IEEE Transactions on Systems, Man and Cybernetics, 17(6):982-992, 1987.
32. J. Ruiz, S. España, and P. García. Locally threshold testable languages in strict sense: application to the inference problem. In V. Honvar and G. Slutzki, editors, Grammatical Inference, 4th Intern. Coll. ICGI-98, volume 1433 of LNCS, pages 150-161, 1998.
33. Y. Takada. Grammatical inference of even linear languages based on control sets. Information Processing Letters, 28:193-199, 1988.
34. Y. Takada. Learning even equal matrix languages based on control sets. In A. Nakamura et al., editors, Parallel Image Analysis, ICPIA’92, volume 652 of LNCS, pages 274-289, 1992.
35. Y. Takada. Learning semilinear sets from examples and via queries. Theoretical Computer Science, 104:207-233, 1992.
36. Y. Takada. A hierarchy of language families learnable by regular language learning. Information and Computation, 123:138-145, 1995.
37. Y. Takada. Learning formal languages based on control sets. In K. P. Jantke and S. Lange, editors, Algorithmic Learning for Knowledge-Based Systems, volume 961 of LNCS/LNAI, pages 317-339, 1995