Losing recognizability

被引：0
|
作者：
Vagvolgyi, Sandor [1 ]
机构：
[1] Univ Szeged, Dept Fdn Comp Sci, H-6720 Szeged, Hungary
来源：
THEORETICAL COMPUTER SCIENCE | 2007年 / 379卷 / 1-2期
基金：
匈牙利科学研究基金会;
关键词：
rewrite systems; sets of descendants; tree automata; recognizability preserving;
D O I：
10.1016/j.tcs.2007.03.050
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the ranked alphabet Sigma consisting of a binary symbol. We give a rewrite system R over Sigma such that R effectively preserves recognizability on any ranked alphabet obtained by adding finitely many nullary symbols to Sigma. However, R does not preserve recognizability on the ranked alphabet obtained by adding one unary and one nullary symbol to Sigma. (c) 2007 Elsevier B.V All rights reserved.
引用
收藏
页码：298 / 304
页数：7
相关论文
共 50 条
12345