Real-counter automata and their decision problems (extended abstract)

被引:0
|
作者
Dang, Zhe [1 ]
Ibarra, Oscar H. [2 ]
San Pietro, Pierluigi [3 ]
Xie, Gaoyan [1 ]
机构
[1] School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA 99164, United States
[2] Department of Computer Science, University of California, Santa Barbara, CA 93106, United States
[3] Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy
关键词
★ The research of Zhe Dang and Gaoyan Xie was supported in part by NSF Grant CCF-0430531. The research of Oscar H. Ibarra has been supported in part by by NSF Grants IIS-0101134; CCR-0208595; and CCF-0430945. The research of Pierluigi San Pietro has been supported in part by MIUR grants FIRB RBAU01MCAC; COFIN 2003012437-004. ★★ Corresponding author (zdang@eecs.wsu.edu);
D O I
10.1007/978-3-540-30538-5_17
中图分类号
学科分类号
摘要
28
引用
收藏
页码:198 / 210
相关论文
共 50 条
  • [21] Decision Problems for Parametric Timed Automata
    Andre, Etienne
    Lime, Didier
    Roux, Olivier H.
    FORMAL METHODS AND SOFTWARE ENGINEERING, ICFEM 2016, 2016, 10009 : 400 - 416
  • [22] 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
  • [23] Decision Problems for Reversible and Permutation Automata
    Radionova, Maria
    Okhotin, Alexander
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2024, 2024, 15015 : 302 - 315
  • [24] Case-based decision: An extended abstract
    Gilboa, I
    Schmeidler, D
    ECAI 1998: 13TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 1998, : 706 - 710
  • [25] k+ Decision Trees (Extended Abstract)
    Aspnes, James
    Blais, Eric
    Demirbas, Murat
    O'Donnell, Ryan
    Rudra, Atri
    Uurtamo, Steve
    ALGORITHMS FOR SENSOR SYSTEMS, 2010, 6451 : 74 - +
  • [26] Simulation is decidable for one-counter nets (Extended abstract)
    Abdulla, PA
    Cerans, K
    CONCUR'98: CONCURRENCY THEORY, 1998, 1466 : 253 - 268
  • [27] On the Advice Complexity of Online Problems (Extended Abstract)
    Boeckenhauer, Hans-Joachim
    Komm, Dennis
    Kralovic, Rastislav
    Kralovic, Richard
    Moemke, Tobias
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 331 - +
  • [28] On problems without polynomial kernels (Extended Abstract)
    Bodlaender, Hans L.
    Downey, Rodney G.
    Fellows, Michael R.
    Hermelin, Danny
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, PROCEEDINGS, 2008, 5125 : 563 - +
  • [29] Combinatorial feature selection problems (extended abstract)
    Charikar, M
    Guruswami, V
    Kumar, R
    Rajagopalan, S
    Sahai, A
    41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, : 631 - 640
  • [30] Finite automata, digraph connectivity, and regular expression size (extended abstract)
    Gruber, Hermann
    Holzer, Markus
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 2, PROCEEDINGS, 2008, 5126 : 39 - +