Context free grammar and the infinite-state automaton

被引:0
|
作者
Lu, Yingzhi [1 ]
机构
[1] Tsinghua Univ, Beijing, China
来源
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:23 / 27
相关论文
共 50 条
  • [1] Stability of fuzzy infinite-state automaton
    Wu, Qinge
    Wang, Tuo
    Huang, Yongxuan
    Li, Jisheng
    Advances in Intelligent IT: Active Media Technology 2006, 2006, 138 : 404 - 407
  • [2] Approximate matching between a context-free grammar and a finite-state automaton
    Ko, Sang-Ki
    Han, Yo-Sub
    Salomaa, Kai
    INFORMATION AND COMPUTATION, 2016, 247 : 278 - 289
  • [3] Infinite-State Energy Games
    Abdulla, Parosh Aziz
    Atig, Mohamed Faouzi
    Hofman, Piotr
    Mayr, Richard
    Kumar, K. Narayan
    Totzke, Patrick
    PROCEEDINGS OF THE JOINT MEETING OF THE TWENTY-THIRD EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC (CSL) AND THE TWENTY-NINTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2014,
  • [4] Foundations of Infinite-State Verification
    Majumdar, Rupak
    SOFTWARE SYSTEMS SAFETY, 2014, 36 : 191 - 222
  • [5] INFINITE WORDS GENERATED BY CONTEXT-FREE GRAMMAR
    NIVAT, M
    RAIRO-INFORMATIQUE-COMPUTER SCIENCE, 1977, 11 (04): : 311 - 327
  • [6] A PUSHDOWN AUTOMATON OR A CONTEXT-FREE GRAMMAR - WHICH IS MORE ECONOMICAL
    GOLDSTINE, J
    PRICE, JK
    WOTSCHKE, D
    THEORETICAL COMPUTER SCIENCE, 1982, 18 (01) : 33 - 40
  • [7] Some perspectives of infinite-state verification
    Thomas, W
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS, 2005, 3707 : 3 - 10
  • [8] LTL falsification in infinite-state systems
    Cimatti, Alessandro
    Griggio, Alberto
    Magnago, Enrico
    INFORMATION AND COMPUTATION, 2022, 289
  • [9] On finite representations of infinite-state behaviours
    Kucera, A
    INFORMATION PROCESSING LETTERS, 1999, 70 (01) : 23 - 30
  • [10] Composability of infinite-state activity automata
    Dang, Z
    Ibarra, OH
    Su, JW
    ALGORITHMS AND COMPUTATION, 2004, 3341 : 377 - 388