On Chomsky Hierarchy of Palindromic Languages

被引：1
|
作者：
Domosi, Pal [1 ]
Fazekas, Szilard [2 ]
Ito, Masami [3 ]
机构：
[1] Coll Nyiregyhaza, Inst Math & Informat, Sostoi Ut 31-B, H-4400 Nyiregyhaza, Hungary
[2] Akita Univ, Dept Informat Sci & Engn, Akita, Tegatagakuen Ci 0108502, Japan
[3] Kyoto Sangyo Univ, Dept Math, Kyoto 603, Japan
来源：
ACTA CYBERNETICA | 2016年 / 22卷 / 03期
关键词：
palindromic formal languages; combinatorics of words and languages;
D O I：
10.14232/actacyb.22.3.2016.10
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The characterization of the structure of palindromic regular and palindromic context-free languages is described by S. Horvath, J. Karhumaki, and J. Kleijn in 1987. In this paper alternative proofs are given for these characterizations.
引用
收藏
页码：703 / 713
页数：11
相关论文
共 50 条
12345