Detail publikace
How to Demonstrate Contextfreeness by Tree-Restricted General Grammars
HAVEL, M.; KŘIVKA, Z.; MEDUNA, A.; SOUKUP, O. How to Demonstrate Contextfreeness by Tree-Restricted General Grammars. Journal of Automata, Languages and Combinatorics, 2026, p. 0-0. ISSN: 1430-189X.
Typ
článek v časopise
Jazyk
anglicky
Autoři
Havel Martin, Ing.
(UIFS)
Křivka Zbyněk, Ing., Ph.D. (UIFS)
Meduna Alexandr, prof. RNDr., CSc. (UIFS)
Soukup Ondřej, Ing., Ph.D.
Křivka Zbyněk, Ing., Ph.D. (UIFS)
Meduna Alexandr, prof. RNDr., CSc. (UIFS)
Soukup Ondřej, Ing., Ph.D.
Rok
2026
Strany
16
Časopis
Journal of Automata, Languages and Combinatorics, ISSN 1430-189X
BibTeX
@article{BUT192998,
author="Martin {Havel} and Zbyněk {Křivka} and Alexandr {Meduna} and Ondřej {Soukup}",
title="How to Demonstrate Contextfreeness by Tree-Restricted General Grammars",
journal="Journal of Automata, Languages and Combinatorics",
year="2026",
pages="16",
issn="1430-189X",
url="https://www.fit.vut.cz/research/publication/11057/"
}
Soubory