Standard

Representing recursively enumerable languages by iterated deletion. / Domaratzki, Michael; Okhotin, Alexander.

в: Theoretical Computer Science, Том 314, № 3, 10.04.2004, стр. 451-457.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Domaratzki, M & Okhotin, A 2004, 'Representing recursively enumerable languages by iterated deletion', Theoretical Computer Science, Том. 314, № 3, стр. 451-457. https://doi.org/10.1016/j.tcs.2004.01.002

APA

Domaratzki, M., & Okhotin, A. (2004). Representing recursively enumerable languages by iterated deletion. Theoretical Computer Science, 314(3), 451-457. https://doi.org/10.1016/j.tcs.2004.01.002

Vancouver

Domaratzki M, Okhotin A. Representing recursively enumerable languages by iterated deletion. Theoretical Computer Science. 2004 Апр. 10;314(3):451-457. https://doi.org/10.1016/j.tcs.2004.01.002

Author

Domaratzki, Michael ; Okhotin, Alexander. / Representing recursively enumerable languages by iterated deletion. в: Theoretical Computer Science. 2004 ; Том 314, № 3. стр. 451-457.

BibTeX

@article{8d1db0b3f7e94f4a9d4c329483eeead1,
title = "Representing recursively enumerable languages by iterated deletion",
abstract = "A characterization of the recursively enumerable languages in terms of the iterated deletion operation is given. This solves two open problems posed by Ito and Silva on the closure properties and decidability of iterated deletion.",
keywords = "Iterated sequential deletion, Linear context-free languages, Recursively enumerable languages",
author = "Michael Domaratzki and Alexander Okhotin",
year = "2004",
month = apr,
day = "10",
doi = "10.1016/j.tcs.2004.01.002",
language = "English",
volume = "314",
pages = "451--457",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "3",

}

RIS

TY - JOUR

T1 - Representing recursively enumerable languages by iterated deletion

AU - Domaratzki, Michael

AU - Okhotin, Alexander

PY - 2004/4/10

Y1 - 2004/4/10

N2 - A characterization of the recursively enumerable languages in terms of the iterated deletion operation is given. This solves two open problems posed by Ito and Silva on the closure properties and decidability of iterated deletion.

AB - A characterization of the recursively enumerable languages in terms of the iterated deletion operation is given. This solves two open problems posed by Ito and Silva on the closure properties and decidability of iterated deletion.

KW - Iterated sequential deletion

KW - Linear context-free languages

KW - Recursively enumerable languages

UR - http://www.scopus.com/inward/record.url?scp=1642617570&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2004.01.002

DO - 10.1016/j.tcs.2004.01.002

M3 - Article

AN - SCOPUS:1642617570

VL - 314

SP - 451

EP - 457

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 3

ER -

ID: 41144452