Finite-state Acceptors with Translucent Letters

Benedek Nagy, Friedrich Otto

Abstract

Finite-state acceptors with translucent letters are presented. These devices do not read their input strictly from left to right as in the traditional setting, but for each internal state of such a device, certain letters are translucent, that is, in this state the acceptor cannot see them. We describe the computational power of these acceptors, both in the deterministic and in the nondeterministic case. The languages accepted have semi-linear Parikh images, and the nondeterministic acceptors are sufficiently expressive to accept all rational trace languages. However, in contrast to the classical finite-state acceptors, the deterministic acceptors are less expressive than the nondeterministic ones.

References

  1. Balan, M.S.: Automaton models inpsired by peptide computing. In: Domaratzki, M., Salomaa, K. (eds.): UC'07, Workshop on Language Theory in Biocomputing, Proc., Kingston, Ontario, Canada (2007) 1-15
  2. Diekert, V., Rozenberg, G. (eds.): The Book of Traces, World Scientific, Singapore (1995)
  3. Ibarra, O.: Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach. 25 (1978) 116-133
  4. Janc?ar, P., Mráz, F., Plátek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.): FCT 1995, Proc., Lecture Notes in Computer Science, Vol. 965, Springer-Verlag, Berlin Heidelberg (1995) 283-292
  5. Joshi, A.K.: Mildly Context-Sensitive Grammars. http://www.kornai.com/MatLing/ mcsfin.pdf (12.11.2010)
  6. Mery, B., Amblard, M., Durand, I., Retoré, C.: A Case Study of the Convergence of Mildly Context-Sensitive Formalisms for Natural Language Syntax: from Minimalist Grammars to Multiple Context-Free Grammars. Rapport de recherche, nr. 6042, INRIA Futurs, Parc Club Orsay Université, Orsay (2006)
  7. Nagy, B., Otto, F.: CD-systems of stateless deterministic R(1)-automata accept all rational trace languages. In: Dediu, A.H., Fernau, H., Martin-Vide, C. (eds.): LATA 2010, Proc., Lecture Notes in Computer Science, Vol. 6031, Springer-Verlag, Berlin Heidelberg (2010) 463-474
  8. Nagy, B., Otto, F.: CD-Systems of Stateless Deterministic R-Automata with Window Size One. Kasseler Informatikschriften 2/2010, Fachbereich Elektrotechnik/Informatik, Universität Kassel, 2010. https://kobra.bibliothek.uni-kassel.de/handle/ urn:nbn:de:hebis:34- 2010042732682
Download


Paper Citation


in Harvard Style

Nagy B. and Otto F. (2011). Finite-state Acceptors with Translucent Letters . In Proceedings of the 1st International Workshop on AI Methods for Interdisciplinary Research in Language and Biology - Volume 1: BILC, (ICAART 2011) ISBN 978-989-8425-42-3, pages 3-13. DOI: 10.5220/0003272500030013


in Bibtex Style

@conference{bilc11,
author={Benedek Nagy and Friedrich Otto},
title={Finite-state Acceptors with Translucent Letters},
booktitle={Proceedings of the 1st International Workshop on AI Methods for Interdisciplinary Research in Language and Biology - Volume 1: BILC, (ICAART 2011)},
year={2011},
pages={3-13},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003272500030013},
isbn={978-989-8425-42-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 1st International Workshop on AI Methods for Interdisciplinary Research in Language and Biology - Volume 1: BILC, (ICAART 2011)
TI - Finite-state Acceptors with Translucent Letters
SN - 978-989-8425-42-3
AU - Nagy B.
AU - Otto F.
PY - 2011
SP - 3
EP - 13
DO - 10.5220/0003272500030013