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 条
  • [1] Real-counter automata and their decision problems (extended abstract)
    Dang, Zhe
    Ibarra, Oscar H.
    San Pietro, Pierluigi
    Xie, Gaoyan
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3328 : 198 - 210
  • [2] ON DECISION PROBLEMS FOR TIMED AUTOMATA
    Finkel, Olivier
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2005, (87): : 185 - 190
  • [3] FINITE AUTOMATA AND THEIR DECISION PROBLEMS
    RABIN, MO
    SCOTT, D
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1959, 3 (02) : 114 - 125
  • [4] Relating Reachability Problems in Timed and Counter Automata
    Haase, Christoph
    Ouaknine, Joel
    Worrell, James
    FUNDAMENTA INFORMATICAE, 2016, 143 (3-4) : 317 - 338
  • [5] DECISION PROBLEMS DEFINITE STOCHASTIC AUTOMATA
    CHEN, IN
    SHENG, CL
    SIAM JOURNAL ON CONTROL, 1970, 8 (01): : 124 - &
  • [6] Decision Problems for Parametric Timed Automata
    Andre, Etienne
    Lime, Didier
    Roux, Olivier H.
    FORMAL METHODS AND SOFTWARE ENGINEERING, ICFEM 2016, 2016, 10009 : 400 - 416
  • [7] On decision problems for probabilistic Buchi automata
    Baier, Christel
    Bertrand, Nathalie
    Groesser, Marcus
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2008, 4962 : 287 - 301
  • [8] Decision Problems for Reversible and Permutation Automata
    Radionova, Maria
    Okhotin, Alexander
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2024, 2024, 15015 : 302 - 315
  • [9] Closure properties and decision problems of dag automata
    Anantharaman, S
    Narendram, P
    Rusinowitch, M
    INFORMATION PROCESSING LETTERS, 2005, 94 (05) : 231 - 240
  • [10] Decision Problems on Unary Probabilistic and Quantum Automata
    Hirvensalo, Mika
    Yakaryilmaz, Abuzer
    BALTIC JOURNAL OF MODERN COMPUTING, 2016, 4 (04): : 965 - 976
12345