Two-Head Finite-State Acceptors with Translucent Letters

dc.contributor.authorNagy, Benedek
dc.contributor.authorOtto, Friedrich
dc.date.accessioned2026-02-06T18:17:26Z
dc.date.issued2019
dc.departmentDoğu Akdeniz Üniversitesi
dc.description45th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) -- JAN 27-30, 2019 -- Novy Smokovec, SLOVAKIA
dc.description.abstractFinite-state acceptors are studied that have two heads that read the input from opposite sides. In addition, a set of translucent letters is associated with each state. It is shown that these two-head automata are strictly more expressive than the model with a single head, but that they still only accept languages that have a semi-linear Parikh image. In fact, we obtain a characterization for the class of linear context-free trace languages in terms of a specific class of two-head finite-state acceptors with translucent letters.
dc.description.sponsorshipSlovak Soc Comp Sci,Comenius Univ, Fac Math, Phys, & Informat
dc.identifier.doi10.1007/978-3-030-10801-4_32
dc.identifier.endpage418
dc.identifier.isbn978-3-030-10801-4
dc.identifier.isbn978-3-030-10800-7
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.orcid0009-0002-9760-5462
dc.identifier.scopus2-s2.0-85062357982
dc.identifier.scopusqualityQ3
dc.identifier.startpage406
dc.identifier.urihttps://doi.org/10.1007/978-3-030-10801-4_32
dc.identifier.urihttps://hdl.handle.net/11129/8959
dc.identifier.volume11376
dc.identifier.wosWOS:000612998100032
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer International Publishing Ag
dc.relation.ispartofTheory and Practice of Computer Science, Sofsem 2019
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectTwo-head finite-state acceptor
dc.subjectTranslucent letter
dc.subjectLinear context-free language
dc.subjectSemi-linear Parikh set
dc.subjectTrace language
dc.titleTwo-Head Finite-State Acceptors with Translucent Letters
dc.typeConference Object

Files