Real-counter automata and their decision problems

被引：0
|
作者：
Dang, Z [1 ]
Ibarra, OH
San Pietro, P
Xie, GY
机构：
[1] Washington State Univ, Sch Elect Engn & Comp Sci, Pullman, WA 99164 USA
[2] Univ Calif Santa Barbara, Dept Comp Sci, Santa Barbara, CA 93106 USA
[3] Politecn Milan, Dipartimento Elettron & Informaz, I-20133 Milan, Italy
来源：
FSTTCS 2004: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE | 2004年 / 3328卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We introduce real-counter automata, which are two-way finite automata augmented with counters that take real values. In contrast to traditional word automata that accept sequences of symbols, real-counter automata accept real words that are bounded and closed real intervals delimited by a finite number of markers. We study the membership and emptiness problems for one-way/two-way real-counter automata as well as those automata further augmented with other unbounded storage devices such as integer-counters and pushdown stacks.
引用
收藏
页码：198 / 210
页数：13
相关论文
共 50 条
  • [41] Decision problems and projection languages for restricted variants of two-dimensional automata
    Smith, Taylor J.
    Salomaa, Kai
    THEORETICAL COMPUTER SCIENCE, 2021, 870 : 153 - 164
  • [42] REGULAR SEPARABILITY OF ONE COUNTER AUTOMATA
    Czerwinski, Wojciech
    Lasota, Slawomir
    LOGICAL METHODS IN COMPUTER SCIENCE, 2019, 15 (02) : 20:1 - 20:27
  • [43] Continuous One-counter Automata
    Blondin, Michael
    Leys, Tim
    Mazowiecki, Filip
    Offtermatt, Philip
    Perez, Guillermo
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2023, 24 (01)
  • [44] On Buchi One-Counter Automata
    Bohm, Stanislav
    Goller, Stefan
    Halfon, Simon
    Hofman, Piotr
    34TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2017), 2017, 66
  • [45] DETERMINISTIC ONE-COUNTER AUTOMATA
    VALIANT, LG
    PATERSON, MS
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 10 (03) : 340 - 350
  • [46] FASTer acceleration of counter automata in practice
    Bardin, S
    Finkel, A
    Leroux, J
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2004, 2988 : 576 - 590
  • [47] Regular Separability of One Counter Automata
    Czerwinski, Wojciech
    Lasota, Slawomir
    2017 32ND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2017,
  • [48] Traps for jumping multihead counter automata
    Bull, M.
    Hemmerling, A.
    Journal of Information Processing and Cybernetics, 1992, 28 (06): : 343 - 361
  • [49] Flat counter automata almost everywhere!
    Leroux, M
    Sutre, G
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS, 2005, 3707 : 489 - 503
  • [50] Continuous One-Counter Automata
    Blondin, Michael
    Leys, Tim
    Mazowiecki, Filip
    Offtermatt, Philip
    Perez, Guillermo A.
    2021 36TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2021,
12345