Linguistic Applications of Finite Automata with Translucent Letters

Benedek Nagy, László Kovács

Abstract

Finite automata with translucent letters do not read their input strictly from left to right as traditional finite automata, but for each internal state of such a device, certain letters are translucent, that is, in this state the automaton cannot see them. We address the word problem of these automata, both in the deterministic and in the nondeterministic case. Some interesting examples from the formal language theory and from a segment of the Hungarian language is shown using automata with translucent letters.

References

  1. Chomsky, N. (1957). Syntatic Structures. The Hague: Mouton Co.
  2. Dryer, M. S. (1997). On the six-way word order typology. Studies in Language, 21:69-103.
  3. Dryera, Matthew, S., Haspelmath, and (eds.), M. (2012). The world atlas of langauges structures. Max Planck Digital Library, Munich.
  4. Gazdar, G. (1982). Natural languages and context-free languages. Linguistics and Philosophy, 4:469-473.
  5. Hockett, C. (1955). A manual of phonology. Waverly Press, Baltimore.
  6. Hopcroft, J. E. and Ullman, J. D. (1969). Formal languages and their relation to automata. AddisonWesley Longman Publishing Co., Boston.
  7. Joshi, A. K. (2010). Mildly Context-Sensitive Grammars. http://www.kornai.com/MatLing/mcsfin.pdf.
  8. Kornai, A. (1985). Natural languages and the chomsky hierarchy. Proc. of EACL'85, pages 1-7.
  9. Matthews, R. J. (1979). Are the grammatical sentences of a language a recursive set. Synthese, 40:209-224.
  10. Mery, B., Amblard, M., Durand, I., and Retoré, C. (2006). A case study of the convergence of mildly contextsensitive formalisms for natural language syntax: from minimalist grammars to multiple context-free grammars. INRA Rapport de recherche, page nr 6042.
  11. Nagy, B. and Otto, F. (2011). Finite-state acceptors with translucent letters. BILC 2011 - 1st International Workshop on AI Methods for Interdisciplinary Research in Language and Biology, ICAART 2011 - 3rd International Conference on Agents and Artificial Intelligence, pages 3-13.
  12. Nagy, B. and Otto, F. (2012a). CD-systems of stateless deterministic R-automata with window size one. Journal of Computer and System Sciences, 78:780-806.
  13. Nagy, B. and Otto, F. (2012b). On globally deterministic CD-systems of stateless R-automata with window size one. International Journal of Computer Mathematics, pages online first, doi: 10.1080/00207160.2012.688820.
  14. Reich, P. A. (1969). The finitness of natural languages. Language, 45:831-843.
  15. Sullivan, W. J. (1980). Syntax and linguistic semantics in stratificational theory. Current approaches to syntax, pages 301-327.
  16. Wintner, S. (2002). Formal language theory for natural language processing. Proc. of ACL'02, pages 71-76.
Download


Paper Citation


in Harvard Style

Nagy B. and Kovács L. (2013). Linguistic Applications of Finite Automata with Translucent Letters . In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: LAFLang, (ICAART 2013) ISBN 978-989-8565-38-9, pages 461-469. DOI: 10.5220/0004359504610469


in Bibtex Style

@conference{laflang13,
author={Benedek Nagy and László Kovács},
title={Linguistic Applications of Finite Automata with Translucent Letters},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: LAFLang, (ICAART 2013)},
year={2013},
pages={461-469},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004359504610469},
isbn={978-989-8565-38-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: LAFLang, (ICAART 2013)
TI - Linguistic Applications of Finite Automata with Translucent Letters
SN - 978-989-8565-38-9
AU - Nagy B.
AU - Kovács L.
PY - 2013
SP - 461
EP - 469
DO - 10.5220/0004359504610469