TY - JOUR
T1 - A hierarchy of deterministic languages
AU - Harrison, Michael A.
AU - Yehudai, Amiram
N1 - Funding Information:
supported by National Science Foundation of Computer Science, Tel-Aviv University,
PY - 1979/8
Y1 - 1979/8
N2 - An infinite hierarchy of deterministic context free languages is introduced. The hierarchy is defined by the number of accepting configurations required by deterministic pushdown automata recognizing the languages. The hierarchy is related to some well-known language families. As a consequence we get "relative closure" results for certain subfamilies of the deterministic languages.
AB - An infinite hierarchy of deterministic context free languages is introduced. The hierarchy is defined by the number of accepting configurations required by deterministic pushdown automata recognizing the languages. The hierarchy is related to some well-known language families. As a consequence we get "relative closure" results for certain subfamilies of the deterministic languages.
UR - http://www.scopus.com/inward/record.url?scp=0018504819&partnerID=8YFLogxK
U2 - 10.1016/0022-0000(79)90014-X
DO - 10.1016/0022-0000(79)90014-X
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0018504819
SN - 0022-0000
VL - 19
SP - 63
EP - 78
JO - Journal of Computer and System Sciences
JF - Journal of Computer and System Sciences
IS - 1
ER -