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 条
  • [21] Implication of regular expressions
    Thomo, Alex
    APPLIED MATHEMATICS LETTERS, 2012, 25 (10) : 1394 - 1398
  • [22] Synchronized regular expressions
    Giuseppe Della Penna
    Benedetto Intrigila
    Enrico Tronci
    Marisa Venturini Zilli
    Acta Informatica, 2003, 39 : 31 - 70
  • [23] Memoized Regular Expressions
    Van der Merwe, Brink
    Mouton, Jacobie
    Van Litsenborgh, Steyn
    Berglund, Martin
    IMPLEMENTATION AND APPLICATION OF AUTOMATA (CIAA 2021), 2021, 12803 : 39 - 52
  • [24] Intersection of -ω-Regular Expressions
    A. N. Chebotarev
    Cybernetics and Systems Analysis, 2021, 57 : 676 - 684
  • [25] On a generalization of regular expressions
    Gomozov, AL
    Stanevichene, LI
    PROGRAMMING AND COMPUTER SOFTWARE, 2000, 26 (05) : 258 - 267
  • [26] On Extended Regular Expressions
    Carle, Benjamin
    Narendran, Paliath
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 279 - 289
  • [27] Regular Expressions with Lookahead
    Berglund, Martin
    van Der Merwe, Brink
    van Litsenborgh, Steyn
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2021, 27 (04) : 324 - 340
  • [28] Regular expressions of conditions
    Popa, Emil Marin
    3RD INT CONF ON CYBERNETICS AND INFORMATION TECHNOLOGIES, SYSTEMS, AND APPLICAT/4TH INT CONF ON COMPUTING, COMMUNICATIONS AND CONTROL TECHNOLOGIES, VOL 3, 2006, : 174 - 176
  • [29] Rewriting of regular expressions and regular path queries
    Calvanese, D
    De Giacomo, G
    Lenzerini, M
    Vardi, MY
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2002, 64 (03) : 443 - 465
  • [30] Regular binoid expressions and regular binoid languages
    Hashiguchi, K
    Wada, Y
    Jimbo, S
    THEORETICAL COMPUTER SCIENCE, 2003, 304 (1-3) : 291 - 313
12345