Finite-state Acceptors with Translucent Letters

Benedek Nagy; Friedrich Otto

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Finite-state Acceptors with Translucent Letters

In Proceedings of the 1st International Workshop on AI Methods for Interdisciplinary Research in Language and Biology - Volume 0ICAART, 3-13, 2011 , Rome, Italy

Authors: Benedek Nagy ¹ and Friedrich Otto ²

Affiliations: ¹ University of Debrecen, Hungary ; ² 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

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

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

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 (ICAART 2011) - BILC; ISBN 978-989-8425-42-3, SciTePress, 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 (ICAART 2011) - BILC},
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 (ICAART 2011) - BILC
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
PB - SciTePress