ONE-WAY GLOBALLY DETERMINISTIC SYNCHRONIZED ALTERNATING FINITE AUTOMATA RECOGNIZE EXACTLY DETERMINISTIC CONTEXT-SENSITIVE LANGUAGES

被引：3

作者：

SLOBODOVA, A

机构：

[1] Department of Computer Science, Comenius University

来源：

关键词：

Computational complexity; formal languages; synchronized alternation;

D O I：

10.1016/0020-0190(90)90099-J

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：69 / 72

页数：4

共 10 条

[1] ALTERNATION [J].

CHANDRA, AK ;

KOZEN, DC ;

STOCKMEYER, LJ .

[2]

DASSOW J, 1989, LECT NOTES COMPUT SC, V379, P196

[3]

HROMKOVIC J, 1989, 21989 COM U COMP SCI

[4]

HROMKOVIC J, 1989, DETERMINISTIC VERSUS

[5]

HROMKOVIC J, IN PRESS DISCRETE AP

[6]

HROMKOVIC J, 1986, UNPUB ORG COMMUNICAT

[7]

SLOBODOVA A, 1989, LECT NOTES COMPUT SC, V381, P102, DOI 10.1007/BFb0015931

[8]

SLOBODOVA A, 1988, LECT NOTES COMPUT SC, V324, P518, DOI 10.1007/BFb0017175

[9]

SLOBODOVA A, 1987, POWER COMMUNICATION

[10]

SLOBODOVA A, IN PRESS ACTA INFORM