Standard
Boolean grammars. / Okhotin, Alexander.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Zoltan Esik; Zoltan Fulop. Springer Nature, 2003. p. 398-410 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2710).
Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research › peer-review
Harvard
Okhotin, A 2003,
Boolean grammars. in Z Esik & Z Fulop (eds),
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2710, Springer Nature, pp. 398-410.
https://doi.org/10.1007/3-540-45007-6_32
APA
Okhotin, A. (2003).
Boolean grammars. In Z. Esik, & Z. Fulop (Eds.),
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 398-410). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2710). Springer Nature.
https://doi.org/10.1007/3-540-45007-6_32
Vancouver
Okhotin A.
Boolean grammars. In Esik Z, Fulop Z, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Nature. 2003. p. 398-410. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
https://doi.org/10.1007/3-540-45007-6_32
Author
Okhotin, Alexander. /
Boolean grammars. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Zoltan Esik ; Zoltan Fulop. Springer Nature, 2003. pp. 398-410 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
BibTeX
@inbook{135e6375a6f14de0b62f2d44dbf8a6e8,
title = "Boolean grammars",
abstract = "As a direct continuation of the earlier research on conjunctive grammars - context-free grammars equipped with intersection - this paper introduces a new class of formal grammars, which allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous semantics for such grammars is defined by language equations in a way that allows to generalize some techniques from the theory of context-free grammars, including Chomsky normal form, Cocke-Kasami-Younger recognition algorithm and some limited extension of the notion of a parse tree, which together allow to conjecture the practical applicability of the new concept.",
author = "Alexander Okhotin",
year = "2003",
doi = "10.1007/3-540-45007-6_32",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "398--410",
editor = "Zoltan Esik and Zoltan Fulop",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}
RIS
TY - CHAP
T1 - Boolean grammars
AU - Okhotin, Alexander
PY - 2003
Y1 - 2003
N2 - As a direct continuation of the earlier research on conjunctive grammars - context-free grammars equipped with intersection - this paper introduces a new class of formal grammars, which allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous semantics for such grammars is defined by language equations in a way that allows to generalize some techniques from the theory of context-free grammars, including Chomsky normal form, Cocke-Kasami-Younger recognition algorithm and some limited extension of the notion of a parse tree, which together allow to conjecture the practical applicability of the new concept.
AB - As a direct continuation of the earlier research on conjunctive grammars - context-free grammars equipped with intersection - this paper introduces a new class of formal grammars, which allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous semantics for such grammars is defined by language equations in a way that allows to generalize some techniques from the theory of context-free grammars, including Chomsky normal form, Cocke-Kasami-Younger recognition algorithm and some limited extension of the notion of a parse tree, which together allow to conjecture the practical applicability of the new concept.
UR - http://www.scopus.com/inward/record.url?scp=1642631835&partnerID=8YFLogxK
U2 - 10.1007/3-540-45007-6_32
DO - 10.1007/3-540-45007-6_32
M3 - Chapter
AN - SCOPUS:1642631835
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 398
EP - 410
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A2 - Esik, Zoltan
A2 - Fulop, Zoltan
PB - Springer Nature
ER -
