Standard

Homomorphisms preserving deterministic context-free languages. / Lehtinen, Tommi; Okhotin, Alexander.

Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings. 2012. стр. 154-165 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 7410 LNCS).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Lehtinen, T & Okhotin, A 2012, Homomorphisms preserving deterministic context-free languages. в Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 7410 LNCS, стр. 154-165, 16th International Conference on Developments in Language Theory, DLT 2012, Taipei, Китайская Провинция Тайвань, 14/08/12. https://doi.org/10.1007/978-3-642-31653-1_15

APA

Lehtinen, T., & Okhotin, A. (2012). Homomorphisms preserving deterministic context-free languages. в Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings (стр. 154-165). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 7410 LNCS). https://doi.org/10.1007/978-3-642-31653-1_15

Vancouver

Lehtinen T, Okhotin A. Homomorphisms preserving deterministic context-free languages. в Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings. 2012. стр. 154-165. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-31653-1_15

Author

Lehtinen, Tommi ; Okhotin, Alexander. / Homomorphisms preserving deterministic context-free languages. Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings. 2012. стр. 154-165 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{9ad9ad74d7284e81ac78d788dc3e9f3b,
title = "Homomorphisms preserving deterministic context-free languages",
abstract = "The paper characterizes the family of homomorphisms, under which the deterministic context-free languages, the LL context-free languages and the unambiguous context-free languages are closed. The family of deterministic context-free languages is closed under a homomorphism h if and only if h is either a code of bounded deciphering delay, or the images of all symbols under h are powers of the same string. The same characterization holds for LL context-free languages. The unambiguous context-free languages are closed under h if and only if either h is a code, or the images of all symbols under h are powers of the same string.",
author = "Tommi Lehtinen and Alexander Okhotin",
year = "2012",
doi = "10.1007/978-3-642-31653-1_15",
language = "English",
isbn = "9783642316524",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "154--165",
booktitle = "Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings",
note = "16th International Conference on Developments in Language Theory, DLT 2012 ; Conference date: 14-08-2012 Through 17-08-2012",

}

RIS

TY - GEN

T1 - Homomorphisms preserving deterministic context-free languages

AU - Lehtinen, Tommi

AU - Okhotin, Alexander

PY - 2012

Y1 - 2012

N2 - The paper characterizes the family of homomorphisms, under which the deterministic context-free languages, the LL context-free languages and the unambiguous context-free languages are closed. The family of deterministic context-free languages is closed under a homomorphism h if and only if h is either a code of bounded deciphering delay, or the images of all symbols under h are powers of the same string. The same characterization holds for LL context-free languages. The unambiguous context-free languages are closed under h if and only if either h is a code, or the images of all symbols under h are powers of the same string.

AB - The paper characterizes the family of homomorphisms, under which the deterministic context-free languages, the LL context-free languages and the unambiguous context-free languages are closed. The family of deterministic context-free languages is closed under a homomorphism h if and only if h is either a code of bounded deciphering delay, or the images of all symbols under h are powers of the same string. The same characterization holds for LL context-free languages. The unambiguous context-free languages are closed under h if and only if either h is a code, or the images of all symbols under h are powers of the same string.

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

U2 - 10.1007/978-3-642-31653-1_15

DO - 10.1007/978-3-642-31653-1_15

M3 - Conference contribution

AN - SCOPUS:84865006376

SN - 9783642316524

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 154

EP - 165

BT - Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings

T2 - 16th International Conference on Developments in Language Theory, DLT 2012

Y2 - 14 August 2012 through 17 August 2012

ER -

ID: 78945231