The problems of complexity of almost context-free languages [Abstract of thesis]
Commentationes Mathematicae Universitatis Carolinae (1989)
- Volume: 030, Issue: 1, page 202-202
- ISSN: 0010-2628
Access Full Article
topHow to cite
topNgoc, N. V.. "The problems of complexity of almost context-free languages [Abstract of thesis]." Commentationes Mathematicae Universitatis Carolinae 030.1 (1989): 202-202. <http://eudml.org/doc/17729>.
@article{Ngoc1989,
author = {Ngoc, N. V.},
journal = {Commentationes Mathematicae Universitatis Carolinae},
keywords = {almost context-free languages; random access machines; space complexity; approximation of languages; context-free grammars},
language = {eng},
number = {1},
pages = {202-202},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {The problems of complexity of almost context-free languages [Abstract of thesis]},
url = {http://eudml.org/doc/17729},
volume = {030},
year = {1989},
}
TY - JOUR
AU - Ngoc, N. V.
TI - The problems of complexity of almost context-free languages [Abstract of thesis]
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1989
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 030
IS - 1
SP - 202
EP - 202
LA - eng
KW - almost context-free languages; random access machines; space complexity; approximation of languages; context-free grammars
UR - http://eudml.org/doc/17729
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.