2 ω-finite automata and sets of obstructions of their languages

被引：0
|
作者：
Melnikov, B.F. [1 ]
机构：
[1] Department of Mecanics and Mathematics, Simbirsk State University (Russia), L.Tolstoy str., 42, 432700, Simbirsk (Ulyanovsk), Russia
来源：
Journal of Applied Mathematics and Computing | 1999年 / 6卷 / 03期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：565 / 574
相关论文
共 50 条
  • [1] 2 ω-finite automata and sets of obstructions of their languages
    B. F. Melnikov
    Korean Journal of Computational & Applied Mathematics, 1999, 6 (3) : 565 - 574
  • [2] COVER AUTOMATA FOR FINITE LANGUAGES
    Salomaa, Arto
    Yu, Sheng
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2007, (92): : 65 - 74
  • [3] FINITE AUTOMATA AND UNARY LANGUAGES
    CHROBAK, M
    THEORETICAL COMPUTER SCIENCE, 1986, 47 (02) : 149 - 158
  • [4] FINITE AUTOMATA AND RATIONAL LANGUAGES AN INTRODUCTION
    BERSTEL, J
    FORMAL PROPERTIES OF FINITE AUTOMATA AND APPLICATIONS, 1989, 386 : 2 - 14
  • [5] Languages recognizable by quantum finite automata
    Freivalds, R
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 1 - 14
  • [6] Fuzzy multiset finite automata and their languages
    Wang, Jinyan
    Yin, Minghao
    Gu, Wenxiang
    SOFT COMPUTING, 2013, 17 (03) : 381 - 390
  • [7] Languages recognized by a class of finite automata
    Kelarev, A.V.
    Sokratova, O.V.
    Acta Cybernetica, 2001, 15 (01): : 45 - 52
  • [8] Quantum Automata and Languages of Finite Index
    Benso, Andrea
    D'Alessandro, Flavio
    Papi, Paolo
    REACHABILITY PROBLEMS, RP 2024, 2024, 15050 : 88 - 103
  • [9] FINITE AUTOMATA AND RATIONAL LANGUAGES AN INTRODUCTION
    BERSTEL, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 386 : 2 - 14
  • [10] LANGUAGES REPRESENTABLE BY FINITE PROBABILISTIC AUTOMATA
    DIEU, PD
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1971, 17 (05): : 427 - &
12345