Regular autodense languages

被引：0
|
作者：
Fan, Chen-Ming [3 ]
Huang, C. C. [1 ]
Shyr, H. J. [2 ]
机构：
[1] Chung Shan Med Univ, Dept Management Informat Syst, Taichung 402, Taiwan
[2] Natl Chung Hsing Univ, Dept Appl Math, Taichung 402, Taiwan
[3] Natl Chin Yi Univ Technol, Dept Informat Management, Taichung 411, Taiwan
来源：
ACTA INFORMATICA | 2008年 / 45卷 / 7-8期
关键词：
Semigroup Forum; Algebraic Property; Regular Language; Common Word; Regular Component;
D O I：
10.1007/s00236-008-0078-z
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A regular component is either autodense or anti-autodense. Characterizations of a regular component being a pure autodense language and being a pure autodense code are obtained. A relationship between intercodes and anti-autodense languages is that for an intercode L of index m, L n is an anti-autodense language for every n > m.
引用
收藏
页码：467 / 477
页数：11
相关论文
共 50 条
  • [41] Balanced-By-Construction Regular and ω-Regular Languages
    Edixhoven, Luc
    Jongmans, Sung-Shik
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2021, 2021, 12811 : 130 - 142
  • [42] Separating Regular Languages by Piecewise Testable and Unambiguous Languages
    Place, Thomas
    van Rooijen, Lorijn
    Zeitoun, Marc
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 729 - 740
  • [43] Regular languages and stone duality
    Pippenger, N
    THEORY OF COMPUTING SYSTEMS, 1997, 30 (02) : 121 - 134
  • [44] Generalised regular MSC languages
    Bollig, B
    Leucker, M
    Noll, T
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2002, 2303 : 52 - 66
  • [45] Private Intersection of Regular Languages
    Guanciale, Roberto
    Gurov, Dilian
    Laud, Peeter
    2014 TWELFTH ANNUAL INTERNATIONAL CONFERENCE ON PRIVACY, SECURITY AND TRUST (PST), 2014, : 112 - 120
  • [46] Circuit complexity of regular languages
    Koucky, Michal
    COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS, 2007, 4497 : 426 - 435
  • [47] A theory of regular MSC languages
    Henriksen, JG
    Mukund, M
    Kumar, KN
    Sohoni, M
    Thiagarajan, PS
    INFORMATION AND COMPUTATION, 2005, 202 (01) : 1 - 38
  • [48] Circuit Complexity of Regular Languages
    Koucky, Michal
    THEORY OF COMPUTING SYSTEMS, 2009, 45 (04) : 865 - 879
  • [49] Entropy of regular timed languages
    Asarin, Eugene
    Basset, Nicolas
    Degorre, Aldric
    INFORMATION AND COMPUTATION, 2015, 241 : 142 - 176
  • [50] Toehold DNA Languages are Regular
    Brandt, Sebastian
    Mattia, Nicolas
    Seidel, Jochen
    Wattenhofer, Roger
    ALGORITHMS AND COMPUTATION, ISAAC 2015, 2015, 9472 : 780 - 790
12345