Probabilistic ω-Regular Expressions

被引：0
|
作者：
Weidner, Thomas [1 ]
机构：
[1] Univ Leipzig, Inst Informat, D-04009 Leipzig, Germany
来源：
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014) | 2014年 / 8370卷
关键词：
AUTOMATA; UNDECIDABILITY; FINITE; POWER;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We introduce probabilistic w-regular expressions which are an extension to classical regular expressions with semantics taking probabilities into account. The main result states that probabilistic w-regular expressions are expressively equivalent to probabilistic Muller-automata. To obtain better decidability properties we introduce a subclass of our expressions with decidable emptiness and approximation problem.
引用
收藏
页码：588 / 600
页数：13
相关论文
共 50 条
  • [41] Automatic Checking of Regular Expressions
    Larson, Eric
    2018 IEEE 18TH INTERNATIONAL WORKING CONFERENCE ON SOURCE CODE ANALYSIS AND MANIPULATION (SCAM), 2018, : 225 - 234
  • [42] Joining Extractions of Regular Expressions
    Freydenberger, Dominik D.
    Kimelfeld, Benny
    Peterfreund, Liat
    PODS'18: PROCEEDINGS OF THE 37TH ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2018, : 137 - 149
  • [43] Regular expressions in C++
    Maddock, J
    DR DOBBS JOURNAL, 2001, 26 (10): : 21 - +
  • [44] Regular expressions with timed dominoes
    Dima, C
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2003, 2731 : 141 - 154
  • [45] On the Uniform Distribution of Regular Expressions
    Broda, Sabine
    Machiavelo, Antonio
    Moreira, Nelma
    Reis, Rogerio
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2021, 2021, 13037 : 13 - 25
  • [46] Enumerating regular expressions and their languages
    Lee, J
    Shallit, J
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2005, 3317 : 2 - 22
  • [47] AYMMETRIC AND ANTISYMMETRIC REGULAR EXPRESSIONS
    GILL, A
    SIAM JOURNAL ON APPLIED MATHEMATICS, 1970, 18 (03) : 539 - &
  • [48] Fuzzy regular tree expressions
    Huang, Xiaofeng
    Mo, Zhiwen
    Shu, Lan
    PROCEEDINGS OF THE 2013 JOINT IFSA WORLD CONGRESS AND NAFIPS ANNUAL MEETING (IFSA/NAFIPS), 2013, : 703 - 708
  • [49] Repairing Regular Expressions for Extraction
    Chida, Nariyoshi
    Terauchi, Tachio
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2023, 7 (PLDI):
  • [50] On Lookaheads in Regular Expressions with Backreferences
    Chida, Nariyoshi
    Terauchi, Tachio
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2023, E106D (05) : 959 - 975
12345