Standard

Underlying Principles and Recurring Ideas of Formal Grammars. / Okhotin, Alexander.

Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Proceedings. Springer Nature, 2018. стр. 36-59 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10792 LNCS).

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

Harvard

Okhotin, A 2018, Underlying Principles and Recurring Ideas of Formal Grammars. в Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 10792 LNCS, Springer Nature, стр. 36-59, 12th International Conference on Language and Automata Theory and Applications, LATA 2018, Ramat Gan, Израиль, 9/04/18. https://doi.org/10.1007/978-3-319-77313-1_3

APA

Okhotin, A. (2018). Underlying Principles and Recurring Ideas of Formal Grammars. в Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Proceedings (стр. 36-59). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10792 LNCS). Springer Nature. https://doi.org/10.1007/978-3-319-77313-1_3

Vancouver

Okhotin A. Underlying Principles and Recurring Ideas of Formal Grammars. в Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Proceedings. Springer Nature. 2018. стр. 36-59. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-77313-1_3

Author

Okhotin, Alexander. / Underlying Principles and Recurring Ideas of Formal Grammars. Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Proceedings. Springer Nature, 2018. стр. 36-59 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{d69bf987d32c4309a8804c422f47f2cc,
title = "Underlying Principles and Recurring Ideas of Formal Grammars",
abstract = "The paper investigates some of the fundamental ideas of the context-free grammar theory, as they are applied to several extensions and subclasses of context-free grammars. For these grammar families, including multi-component grammars, tree-adjoining grammars, conjunctive grammars and Boolean grammars, a summary of the following properties is given: parse trees, language equations, closure under several operations, normal forms, parsing algorithms, representation in the FO(LFP) logic, representations by automata and by categorial grammars, homomorphic characterizations, hardest language theorems, pumping lemmata and other limitations, computational complexity.",
author = "Alexander Okhotin",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-319-77313-1_3",
language = "English",
isbn = "9783319773124",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "36--59",
booktitle = "Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Proceedings",
address = "Germany",
note = "12th International Conference on Language and Automata Theory and Applications, LATA 2018 ; Conference date: 09-04-2018 Through 11-04-2018",

}

RIS

TY - GEN

T1 - Underlying Principles and Recurring Ideas of Formal Grammars

AU - Okhotin, Alexander

PY - 2018/1/1

Y1 - 2018/1/1

N2 - The paper investigates some of the fundamental ideas of the context-free grammar theory, as they are applied to several extensions and subclasses of context-free grammars. For these grammar families, including multi-component grammars, tree-adjoining grammars, conjunctive grammars and Boolean grammars, a summary of the following properties is given: parse trees, language equations, closure under several operations, normal forms, parsing algorithms, representation in the FO(LFP) logic, representations by automata and by categorial grammars, homomorphic characterizations, hardest language theorems, pumping lemmata and other limitations, computational complexity.

AB - The paper investigates some of the fundamental ideas of the context-free grammar theory, as they are applied to several extensions and subclasses of context-free grammars. For these grammar families, including multi-component grammars, tree-adjoining grammars, conjunctive grammars and Boolean grammars, a summary of the following properties is given: parse trees, language equations, closure under several operations, normal forms, parsing algorithms, representation in the FO(LFP) logic, representations by automata and by categorial grammars, homomorphic characterizations, hardest language theorems, pumping lemmata and other limitations, computational complexity.

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

UR - http://www.mendeley.com/research/underlying-principles-recurring-ideas-formal-grammars

U2 - 10.1007/978-3-319-77313-1_3

DO - 10.1007/978-3-319-77313-1_3

M3 - Conference contribution

AN - SCOPUS:85045320381

SN - 9783319773124

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

SP - 36

EP - 59

BT - Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Proceedings

PB - Springer Nature

T2 - 12th International Conference on Language and Automata Theory and Applications, LATA 2018

Y2 - 9 April 2018 through 11 April 2018

ER -

ID: 33856773