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 条
  • [31] Blind counter automata on ω-words
    Fernau, Henning
    Stiebe, Ralf
    FUNDAMENTA INFORMATICAE, 2008, 83 (1-2) : 51 - 64
  • [32] Exact Affine Counter Automata
    Nakanishi, Masaki
    Khadiev, Kamil
    Prusis, Krisjanis
    Vihrovs, Jevgenijs
    Yakaryilmaz, Abuzer
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2022, 33 (03N04) : 349 - 370
  • [33] Flat parametric counter automata
    Bozga, Marius
    Iosif, Radu
    Lakhnech, Yassine
    AUTOMATA, LANGAGES AND PROGRAMMING, PT 2, 2006, 4052 : 577 - 588
  • [34] Flat Parametric Counter Automata
    Bozga, Marius
    Iosif, Radu
    Lakhnech, Yassine
    FUNDAMENTA INFORMATICAE, 2009, 91 (02) : 275 - 303
  • [35] Programs with lists are counter automata
    Bouajjani, Ahmed
    Bozga, Marius
    Habermehl, Peter
    Iosif, Radu
    Moro, Pierre
    Vojnar, Tomas
    COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2006, 4144 : 517 - 531
  • [36] Mining a Class of Decision Problems for One-dimensional Cellular Automata
    Lobos, Fabiola
    Goles, Eric
    Ruivo, Eurico L. P.
    de Oliveira, Pedro P. B.
    Montealegre, Pedro
    JOURNAL OF CELLULAR AUTOMATA, 2018, 13 (5-6) : 393 - 405
  • [37] CLOSEDNESS PROPERTIES AND DECISION PROBLEMS FOR FINITE MULTI-TAPE AUTOMATA
    STARKE, PH
    KYBERNETIKA, 1976, 12 (02) : 61 - 75
  • [38] A NOTE ON THE SPACE COMPLEXITY OF SOME DECISION-PROBLEMS FOR FINITE AUTOMATA
    JIANG, T
    RAVIKUMAR, B
    INFORMATION PROCESSING LETTERS, 1991, 40 (01) : 25 - 31
  • [39] Mining a class of decision problems for one-dimensional cellular automata
    De Oliveira, Pedro P. B. (pp.balbi@gmail.com), 2018, Old City Publishing (13) : 5 - 6
  • [40] Computational Complexity of Decision Problems on Self-verifying Finite Automata
    Holzer, Markus
    Jakobi, Sebastian
    Jirasek, Jozef, Jr.
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 404 - 415
12345