On linear languages recognized by deterministic biautomata

J 2022

On linear languages recognized by deterministic biautomata

JIRÁSKOVÁ, Galina a Ondřej KLÍMA

Základní údaje

Originální název

On linear languages recognized by deterministic biautomata

Autoři

JIRÁSKOVÁ, Galina a Ondřej KLÍMA

Vydání

Information and Computation, Elsevier, 2022, 0890-5401

Další údaje

Jazyk

angličtina

Typ výsledku

Článek v odborném periodiku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Spojené státy

Utajení

není předmětem státního či obchodního tajemství

Odkazy

URL

Impakt faktor

Impact factor: 1.000

Označené pro přenos do RIV

Ano

Kód RIV

RIV/00216224:14310/22:00129032

Organizační jednotka

Přírodovědecká fakulta

Klíčová slova anglicky

Linear languages; Deterministic biautomata; Deterministic linear grammars

Štítky

14311010, rivok

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 11. 7. 2022 08:43, Mgr. Marie Novosadová Šípková, DiS.

Anotace

V originále

We introduce the notion of a deterministic biautomaton, a device that reads inputs from both ends, and admits at most one computation on every input word. We show that deterministic biautomata recognize a class of languages which is properly included in the class of linear languages, and which is incomparable to the class of languages recognized by deterministic one-turn pushdown automata. We propose three restrictions of the basic model of deterministic biautomata to characterize the classes of languages generated by DL, linear LL(1), and NH-DL grammars. This results in a chain of four subclasses of linear languages in which all inclusions are strict. For these subclasses and basic operations, we show whether or not a particular class is closed under a considered operation. We prove that it is undecidable whether a linear language belongs to any of these four classes and answer some other decidability questions.

Návaznosti

GBP202/12/G061, projekt VaV

Název: Centrum excelence - Institut teoretické informatiky (CE-ITI) (Akronym: CE-ITI)

Investor: Grantová agentura ČR, Centrum excelence - Institut teoretické informatiky

Citovat

JIRÁSKOVÁ, Galina a Ondřej KLÍMA. On linear languages recognized by deterministic biautomata. Information and Computation. Elsevier, 2022, roč. 286, July, s. 1-22. ISSN 0890-5401. Dostupné z: https://doi.org/10.1016/j.ic.2021.104778.

@article{1839842,
   author = {Jirásková, Galina and Klíma, Ondřej},
   article_number = {July},
   doi = {https://doi.org/10.1016/j.ic.2021.104778},
   keywords = {Linear languages; Deterministic biautomata; Deterministic linear grammars},
   language = {eng},
   issn = {0890-5401},
   journal = {Information and Computation},
   title = {On linear languages recognized by deterministic biautomata},
   url = {https://www.sciencedirect.com/science/article/pii/S0890540121000936#!},
   volume = {286},
   year = {2022}
}

TY  - JOUR
ID  - 1839842
AU  - Jirásková, Galina - Klíma, Ondřej
PY  - 2022
TI  - On linear languages recognized by deterministic biautomata
JF  - Information and Computation
VL  - 286
IS  - July
SP  - 1-22
EP  - 1-22
PB  - Elsevier
SN  - 08905401
KW  - Linear languages
KW  - Deterministic biautomata
KW  - Deterministic linear grammars
UR  - https://www.sciencedirect.com/science/article/pii/S0890540121000936#!
N2  - We introduce the notion of a deterministic biautomaton, a device that reads inputs from both ends, and admits at most one computation on every input word. We show that deterministic biautomata recognize a class of languages which is properly included in the class of linear languages, and which is incomparable to the class of languages recognized by deterministic one-turn pushdown automata. We propose three restrictions of the basic model of deterministic biautomata to characterize the classes of languages generated by DL, linear LL(1), and NH-DL grammars. This results in a chain of four subclasses of linear languages in which all inclusions are strict. For these subclasses and basic operations, we show whether or not a particular class is closed under a considered operation. We prove that it is undecidable whether a linear language belongs to any of these four classes and answer some other decidability questions.
ER  -

JIRÁSKOVÁ, Galina a Ondřej KLÍMA. On linear languages recognized by deterministic biautomata. \textit{Information and Computation}. Elsevier, 2022, roč.~286, July, s.~1-22. ISSN~0890-5401. Dostupné z: https://doi.org/10.1016/j.ic.2021.104778.

Přehled o publikaci