首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
PUSHDOWN-AUTOMATA ON INFINITE-TREES AND OMEGA-KLEENE CLOSURE OF CONTEXT-FREE TREE SETS
被引:0
|
作者
:
SAOUDI, A
论文数:
0
引用数:
0
h-index:
0
SAOUDI, A
机构
:
来源
:
LECTURE NOTES IN COMPUTER SCIENCE
|
1989年
/ 379卷
关键词
:
D O I
:
暂无
中图分类号
:
TP31 [计算机软件];
学科分类号
:
081202 ;
0835 ;
摘要
:
引用
收藏
页码:445 / 457
页数:13
相关论文
共 2 条
[1]
Pushdown automata free of explicit nondeterminism and an infinite hierarchy of context-free languages
Rene Callejas Bedregal, Benjamin
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Fed Rio Grande do Norte, Dept Informat & Appl Math, Lab Log & Computat Intelligence, BR-59072970 Natal, RN, Brazil
Univ Fed Rio Grande do Norte, Dept Informat & Appl Math, Lab Log & Computat Intelligence, BR-59072970 Natal, RN, Brazil
Rene Callejas Bedregal, Benjamin
FUNDAMENTA INFORMATICAE,
2007,
81
(04)
: 367
-
377
[2]
Combination of context-free grammars and tree automata for unranked and ranked trees
Fujiyoshi, Akio
论文数:
0
引用数:
0
h-index:
0
机构:
Ibaraki Univ, Dept Comp & Informat Sci, Hitachi, Ibaraki 3168511, Japan
Ibaraki Univ, Dept Comp & Informat Sci, Hitachi, Ibaraki 3168511, Japan
Fujiyoshi, Akio
IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS,
2008,
5148
: 283
-
285
←
1
→