Multi-tape automata for speech and language systems: A prolog implementation

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

Volumn 1436, Issue , 1998, Pages 88-103

  Kiraz, George Anton ^a   Grimley Evans, Edmund ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

A-PROLOG; MULTI-TAPE AUTOMATON; REWRITE RULES;

AUTOMATA THEORY;

EID: 71049175376     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0031383     Document Type: Conference Paper

References (17)

1. Carlsson, M. 1996. Personal communication to Edmund Grimley-Evans and posting to the Usenet news groups comp. lang.prolog (16 july 1996).
2. Eilenberg, S. 1974. Automata, Languages, and Machines, volume A. Academic Press.
3. Elgot, C. and J. Mezei. 1965. On relations defined by generalized finite automata. IBM Journal of Research and Development, 9:47-68.
4. Hopcroft, J. and J. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.
5. Kaplan, R. and M. Kay. 1994. Regular models of phonological rule systems. Computational Linguistics, 20(3):331-78.
6. Kay, M. 1987. Nonconcatenative finite-state morphology. In Proceedings of the Third Conference of the European Chapter of the Association for Computational Linguistics, pages 2-10.
7. Kiraz, G. 1994. Multi-tape two-level morphology: a case study in Semitic nonlinear morphology. In COLINGSf: Papers Presented to the 15th International Conference on Computational Linguistics, volume 1, pages 180-6.
8. Kiraz, G. [Forthcoming]. Computational Approach to Nonlinear Morphology: with emphasis on Semitic languages. Cambridge University Press.
9. Mealy, G. 1955. A method for synthesizing sequential circuits. Bell System Technical Journal, 34(5):1045-79.
10. Nivat, M. 1968. Transductions des languages de Chomsky. Ann. Inst. Fourier (Grenoble), 18:339-455.
11. O’Keefe, R. 1990. The Craft of Prolog. The MIT Press.
12. Rabin, M. and D. Scott. 1959. Finite automata and their decision problems. IBM Journal of Research and Development, 3:114-25. Reprinted in Moore, E. (ed.) Sequential Machines. Addison-Wesley, Reading, Massachussetts, 1964, pp. 63-91.
13. Raymond, D. and D. Wood. 1996. The Grail papers. Technical report, University of Western Ontario, Department of Computer Science. Technical Report TR-491.
14. Roche, E., editor. 1997. Finite-State Language Processing. MIT Press.
15. Swedish Institute of Computer Science, 1995. SICStus Prolog User’s Manual.
16. Watson, B. 1995. Taxonomies and Toolkits of Regular Language Algorithms. Ph.D. thesis, Technische Universiteit Eindhoven.
17. Watson, B. 1996. Implementing and using finite automata toolkits. In ECAI Workshop on Extended Finite-State Models of Language.