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 条
  • [41] Latvian Quantum Finite State Automata for Unary Languages
    Mereghetti, Carlo
    Palano, Beatrice
    Raucci, Priscilla
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2023, 388 : 63 - 78
  • [42] FINITE-STATE UNIFICATION AUTOMATA AND RELATIONAL LANGUAGES
    SHEMESH, Y
    FRANCEZ, N
    INFORMATION AND COMPUTATION, 1994, 114 (02) : 192 - 213
  • [43] Alternating finite automata and star-free languages
    Salomaa, K
    Yu, S
    THEORETICAL COMPUTER SCIENCE, 2000, 234 (1-2) : 167 - 176
  • [44] On the representation and management of finite sets in CLP languages
    Dovier, A
    Piazza, C
    Rossi, G
    Pontelli, E
    LOGIC PROGRAMMING - PROCEEDINGS OF THE 1998 JOINT INTERNATIONAL CONFERENCE AND SYMPOSIUM ON LOGIC PROGRAMMING, 1998, : 40 - 54
  • [45] An O(n2) algorithm for constructing minimal cover automata for finite languages
    Paun, A
    Sântean, N
    Yu, S
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2001, 2088 : 243 - 251
  • [46] Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
    Golovkins, Marats
    Kravtsev, Maksim
    Kravcevs, Vasilijs
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 351 - 363
  • [47] MATHEMATICAL NOTES - SETS OF NUMBERS DEFINED BY FINITE AUTOMATA
    HARTMANIS, J
    STEARNS, RE
    AMERICAN MATHEMATICAL MONTHLY, 1967, 74 (05): : 539 - +
  • [48] REALIZATION OF FINITE-AUTOMATION SETS BY DETERMINISTIC AUTOMATA
    MIKHAILOV, GI
    AUTOMATION AND REMOTE CONTROL, 1974, 35 (02) : 267 - 271
  • [49] Learning regular languages using non deterministic finite automata
    Denis, F
    Lemay, A
    Terlutte, A
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, 2000, 1891 : 39 - 50
  • [50] CONCISE REPRESENTATIONS OF REGULAR LANGUAGES BY DEGREE AND PROBABILISTIC FINITE AUTOMATA
    KINTALA, CMR
    PUN, KY
    WOTSCHKE, D
    MATHEMATICAL SYSTEMS THEORY, 1993, 26 (04): : 379 - 395
12345