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
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2004年 / 3328卷
关键词：
★ 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 条
  • [41] Half-Positional Objectives Recognized by Deterministic Buchi Automata (Extended Abstract)
    Bouyer, Patricia
    Casares, Antonio
    Randour, Mickael
    Vandenhove, Pierre
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 6420 - 6425
  • [42] Provably Shorter Regular Expressions from Deterministic Finite Automata (Extended Abstract)
    Gruber, Hermann
    Holzer, Markus
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 383 - +
  • [43] CONCURRENT CONCISENESS OF DEGREE, PROBABILISTIC, NONDETERMINISTIC AND DETERMINISTIC FINITE AUTOMATA - EXTENDED ABSTRACT
    KINTALA, CMR
    WOTSCHKE, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 210 : 291 - 305
  • [44] An automata-theoretic completeness proof for interval temporal logic (extended abstract)
    Moszkowski, BC
    AUTOMATA LANGUAGES AND PROGRAMMING, 2000, 1853 : 223 - 234
  • [45] Complexity study on two clustering problems - (Extended abstract)
    Zhang, LX
    Zhu, S
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 660 - 669
  • [46] Call Admission Problems on Grids with Advice (Extended Abstract)
    Boeckenhauer, Hans-Joachim
    Komm, Dennis
    Wegner, Raphael
    APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2018), 2018, 11312 : 118 - 133
  • [47] Exact Algorithms for Dominating Clique Problems (Extended Abstract)
    Bourgeois, N.
    Della Croce, F.
    Escoffier, B.
    Paschos, V. Th
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 4 - +
  • [48] Locally consistent constraint satisfaction problems -: (Extended abstract)
    Dvorák, Z
    Král, D
    Pangrác, O
    AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 469 - 480
  • [49] DECISION-MAKING PROBLEMS FOR AUTONOMOUS MULTIBAND AUTOMATA
    STARKE, PH
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1976, 22 (02): : 131 - 140
  • [50] Intractability of decision problems for finite-memory automata
    Sakamoto, H
    Ikeda, D
    THEORETICAL COMPUTER SCIENCE, 2000, 231 (02) : 297 - 308
12345