HIERARCHIES OF ONE-WAY MULTIHEAD AUTOMATA LANGUAGES

被引：0
作者：
CHROBAK, M
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1985年 / 194卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：101 / 110
页数：10
相关论文
共 27 条
[1]  
CHROBAK M, 1985, UNPUB J COMPUT SYSTE, V30
[2]   ONE-WAY SIMPLE MULTIHEAD FINITE AUTOMATA ARE NOT CLOSED UNDER CONCATENATION [J].
DURIS, P ;
HROMKOVIC, J .
THEORETICAL COMPUTER SCIENCE, 1983, 27 (1-2) :121-125
[3]  
FLOYD R, 1968, COMPUT REV, V9, P280
[4]   BOUNDED ALGOL-LIKE LANGUAGES [J].
GINSBURG, S ;
SPANIER, EH .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1964, 113 (02) :333-+
[5]  
Ginsburg S., 1966, MATH THEORY CONTEXT
[6]  
GINSBURG S, 1966, P AM MATH SOC, V17, P1043, DOI DOI 10.2307/2036087
[7]   AN INFINITE HIERARCHY OF CONTEXT-FREE LANGUAGES [J].
GREIBACH, SA .
JOURNAL OF THE ACM, 1969, 16 (01) :91-&
[8]   MULTI-TAPE AND MULTI-HEAD PUSHDOWN AUTOMATA [J].
HARRISON, MA ;
IBARRA, OH .
INFORMATION AND CONTROL, 1968, 13 (05) :433-&
[9]   ONE-WAY MULTIHEAD DETERMINISTIC FINITE AUTOMATA [J].
HROMKOVIC, J .
ACTA INFORMATICA, 1983, 19 (04) :377-384
[10]  
HROMKOVIC J, 1981, LECTURE NOTES COMPUT, V118, P304
123