loading
Papers Papers/2020

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Benedek Nagy 1 and Friedrich Otto 2

Affiliations: 1 University of Debrecen, Hungary ; 2 Universität Kassel, Germany

Keyword(s): finite automata, translucent letters, trace language, closure properties

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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.144.55.253

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 - BILC, (ICAART 2011) ISBN 978-989-8425-42-3, pages 3-13. DOI: 10.5220/0003272500030013

@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 - BILC, (ICAART 2011)},
year={2011},
pages={3-13},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003272500030013},
isbn={978-989-8425-42-3},
}

TY - CONF

JO - Proceedings of the 1st International Workshop on AI Methods for Interdisciplinary Research in Language and Biology - 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

0123movie.net