Standard

Unambiguous conjunctive grammars over a one-symbol alphabet. / Jez, Artur; Okhotin, Alexander.

In: Theoretical Computer Science, Vol. 665, 2017, p. 13-39.

Research output: Contribution to journal › Article › peer-review

Harvard

Jez, A & Okhotin, A 2017, 'Unambiguous conjunctive grammars over a one-symbol alphabet', Theoretical Computer Science, vol. 665, pp. 13-39. https://doi.org/10.1016/j.tcs.2016.12.009

APA

Jez, A., & Okhotin, A. (2017). Unambiguous conjunctive grammars over a one-symbol alphabet. Theoretical Computer Science, 665, 13-39. https://doi.org/10.1016/j.tcs.2016.12.009

Vancouver

Jez A, Okhotin A. Unambiguous conjunctive grammars over a one-symbol alphabet. Theoretical Computer Science. 2017;665:13-39. https://doi.org/10.1016/j.tcs.2016.12.009

Author

Jez, Artur ; Okhotin, Alexander. / Unambiguous conjunctive grammars over a one-symbol alphabet. In: Theoretical Computer Science. 2017 ; Vol. 665. pp. 13-39.

BibTeX

@article{a9b86aa6f94849f38c433a780620248d,
title = "Unambiguous conjunctive grammars over a one-symbol alphabet",
author = "Artur Jez and Alexander Okhotin",
year = "2017",
doi = "10.1016/j.tcs.2016.12.009",
language = "English",
volume = "665",
pages = "13--39",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - Unambiguous conjunctive grammars over a one-symbol alphabet

AU - Jez, Artur

AU - Okhotin, Alexander

PY - 2017

Y1 - 2017

U2 - 10.1016/j.tcs.2016.12.009

DO - 10.1016/j.tcs.2016.12.009

M3 - Article

VL - 665

SP - 13

EP - 39

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -

ID: 7745080