Linguistic Applications of Finite Automata with Translucent Letters

Benedek Nagy, László Kovács

2013

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.

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