A NOTE ON 2-WAY PROBABILISTIC-AUTOMATA

被引：11
|
作者：
WANG, J
机构：
[1] Mathematics and Computer Science Department, Wilkes University, Wilkes-Barre
来源：
INFORMATION PROCESSING LETTERS | 1992年 / 43卷 / 06期
基金：
美国国家科学基金会;
关键词：
FORMAL LANGUAGES; 2-WAY PROBABILISTIC FINITE STATE AUTOMATA; DETERMINISTIC CONTEXT-SENSITIVE LANGUAGES; MARKOV CHAIN;
D O I：
10.1016/0020-0190(92)90119-G
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
It has been shown that some non-regular context-free languages can be recognized by two-way probabilistic finite state automata (2pfa's) and some context-free languages cannot be recognized by any 2pfa. It is easy to show that 2pfa's can even recognize some non-context-free context-sensitive languages. We prove in this note that the class of all languages recognized by 2pfa's is strictly included in the class of all deterministic context-sensitive languages.
引用
收藏
页码：321 / 326
页数：6
相关论文
共 50 条
12345