Grammatical inference for the automatic generation of visual languages

International Journal of Software Engineering and Knowledge Engineering

Volumn 9, Issue 4, 1999, Pages 467-493

  Ferrucci, Filomena ^a   Vitiello, Giuliana ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 8744299654     PISSN: 02181940     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218194099000267     Document Type: Article

References (30)

1. B. K. Bhargava and K. S. Fu, "Tree systems for syntactic pattern recognition", IEEE Trans. Computer C-22 (1973) 1087-1099.
2. F. J. Brandenburg, "The computational complexity of certain graph grammars", LNCS 145 (1983) 91-99.
3. F. J. Brandenburg, "On polynomial time graph grammars", LNCS 294 (1988) 227-236.
4. R. Brons, "Linguistic methods for description of a straight line on a grid", Computer Graphics and Image Processing 3 (1974) 48-62.
5. S. K. Chang, Visual Languages and Visual Programming (Plenum Publishing Corp., New York, 1990).
6. S. K. Chang, "A visual language compiler for information retrieval by visual reasoning", IEEE Trans. Software Engineering SE-16 (1990) 1136-1149.
7. S. K. Chang, G. Costagliola, G. Pacini, M. Tucci, G. Tortora, B. Yu and J.-S. Yu, "Visual-language system for user interfaces", IEEE Software 12, 2 (1995) 33-44.
8. G. Costagliola, A. De Lucia, S. Orefice and G. Tortora, "Automatic generation of visual programming environments", IEEE Computer 28 (1995) 56-66.
9. B. Courcelle, "An axiomatic definition of context-free rewriting and its application to NLC graph grammars", Theoretical Computer Science 55 (1987) 141-181.
10. S. Crespi-Reghizzi, M. A. Melkanoff and L. Lichten, "The use of grammatical inference for designing programming languages", Commun. ACM 16 (1973) 83-90.
11. C. Crimi, A. Guercio, G. Pacini, G. Tortora and M. Tucci, "Automating visual language generation", IEEE Trans. Software Engineering, SE-16 (1990) 1122-1135.
12. J. Earley, "An efficient context-free parsing algorithm", in Commun. ACM 13 (1970) 94-102.
13. J. Engelfriet, G. Leih and E. Welzl, "Boundary graph grammars with dynamic edge relabelling", Journal of Computer and System Sciences 40 (1990) 307-345.
14. J. Engelfriet and G. Leih, "Linear graph grammars: power and complexity", Information and Computation 81 (1989) 88-121.
15. J. Engelfriet, "Context-free NCE graph grammars", LCNS 380 (1990) 148-161.
16. F. Ferrucci, G. Tortora, M. Tucci and G. Vitiello, "A predictive parser for visual languages specified by relation grammars", in Proc. IEEE Symposium on Visual Languages, St. Louis, Missouri, 1994, pp. 245-252.
17. F. Ferrucci, G. Pacini, G. Satta, M. I. Sessa, G. Tortora, M. Tucci, and G. Vitiello, "Symbol-relation grammars: a formalism for graphical languages", Information and Computation 131 (1996) 1-46.
18. F. Ferrucci, G. Tortora, M. Tucci and G. Vitiello, "Semantics-based inference algorithms for adaptive visual environments", IEEE Trans. Software Engineering SE-22 (1996) 730-750.
19. F. Ferrucci, F. Napolitano, G. Tortora, M. Tucci and G. Vitiello, "A predictive parser for visual languages specified by relation grammars", in Proc. IEEE Symposium on Visual Languages, Capri, 1997, pp. 292-299.
20. H. Fukuda and H. Kamata, "Inference of tree automata from sample set of trees", Int. J. Computer and Information Sciences 13, 3 (1984) 177-196.
21. P. Garcia and E. Vidai, "Inference of k-testable languages in the strict sense and application to syntactic pattern recognition", IEEE Trans. Pattern Anal. Machine Intell. PAMI-12 (1990) 920-925.
22. P. Garcia, E. Segarra, E. Vidai and I. Galiano, "On the use of Morphic Generator Grammatical Inference (MGGI) methodology in automatic speech recognition", Int. J. Pattern Recognition and Artificial Intelligence 4 (1990) 667-685.
23. R. C. Gonzales, J. J. Edwards and M. G. Thomason, "An algorithm for the inference of tree grammars", Int. J. Computer and Information Sciences 5, 2 (1976) 145-164.
24. D. Janssens and G. Rozenberg, "On the structure of node-label controlled graph languages", Information Sciences 20 (1980) 191-216.
25. D. Janssens and G. Rozenberg, "Restrictions, extensions and variations of NLC grammars", Information Sciences 20 (1980) 217-244.
26. M. Kudo and M. Shimbo, "Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships", Pattern Recognition 21, 4 (1988) 401-409.
27. B Levine "The use of tree derivates and a sample support parameter for inferring free systems", IEEE Trans. Patt. Anal. Mach. Intell. PAMI-4 (1982) 25-34.
28. M. Richetin and F. Vernada, "Efficient regular grammatical inference for pattern recognition", Pattern Recognition 17 (1984) 245-250.
29. G. Rozenberg, "An introduction to the NLC way of rewriting graphs", LNCS 291 (1987) 55-66.
30. A. O. Slisenko, "Context-free grammars as a tool for describing polynomial-time subclasses of hard problems", Inform. Process. Lett. 14 (1982) 52-1-56.