Linguistic Applications of Finite Automata with Translucent Letters

Benedek Nagy; László Kovács

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

Linguistic Applications of Finite Automata with Translucent Letters

In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: LAFLang, 461-469, 2013 , Barcelona, Spain

Authors: Benedek Nagy ¹ and László Kovács ²

Affiliations: ¹ University of Debrecen, Hungary ; ² University of Miskolc, Hungary

Keyword(s): Finite Automata, Mildly Context-sensitive Languages, Natural Languages, Formal Linguistics, Free-order Languages.

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.

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.117.94.221

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 Kovács, L. (2013). Linguistic Applications of Finite Automata with Translucent Letters. In Proceedings of the 5th International Conference on Agents and Artificial Intelligence (ICAART 2013) - Volume 1: LAFLang; ISBN 978-989-8565-38-9; ISSN 2184-433X, SciTePress, pages 461-469. DOI: 10.5220/0004359504610469

@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 (ICAART 2013) - Volume 1: LAFLang},
year={2013},
pages={461-469},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004359504610469},
isbn={978-989-8565-38-9},
issn={2184-433X},
}

TY - CONF

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