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 条
  • [31] Learning regular languages using nondeterministic finite automata
    Garcia, Pedro
    Vazquez de Parga, Manuel
    Alvarez, Gloria I.
    Ruiz, Jose
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2008, 5148 : 92 - +
  • [32] Languages Recognized with Unbounded Error by Quantum Finite Automata
    Yakaryilmaz, Abuzer
    Say, A. C. Cem
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2009, 5675 : 356 - 367
  • [33] Latvian Quantum Finite State Automata for Unary Languages
    Mereghetti, Carlo
    Palano, Beatrice
    Raucci, Priscilla
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,
  • [34] Improved bounds on the number of automata accepting finite languages
    Domaratzki, M
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2004, 15 (01) : 143 - 161
  • [35] Decision Problems for Probabilistic Finite Automata on Bounded Languages
    Bell, Paul C.
    Halava, Vesa
    Hirvensalo, Mika
    FUNDAMENTA INFORMATICAE, 2013, 123 (01) : 1 - 14
  • [36] Finite automata accepting star-connected languages
    Klunder, Barbara
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2007, 4783 : 312 - 313
  • [37] Languages given by finite automata over the unary alphabet
    Czerwinski, Wojciech
    Debski, Maciej
    Gogasz, Tomasz
    Hoi, Gordon
    Jain, Sanjay
    Skrzypczak, Michal
    Stephan, Frank
    Tan, Christopher
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2025, 151
  • [38] BOUNDED-REVERSAL MULTIHEAD FINITE AUTOMATA LANGUAGES
    SUDBOROUGH, IH
    INFORMATION AND CONTROL, 1974, 25 (04): : 317 - 328
  • [39] Improved bounds on the number of automata accepting finite languages
    Domaratzki, M
    DEVELOPMENTS IN LANGUAGE THEORY, 2003, 2450 : 209 - 219
  • [40] Finite graph automata for linear and boundary graph languages
    Brandenburg, FJ
    Skodinis, K
    THEORETICAL COMPUTER SCIENCE, 2005, 332 (1-3) : 199 - 232
12345