Subclasses of recognizable trace languages

被引：0
|
作者：
Reineke, H
机构：
来源：
APPLICATION AND THEORY OF PETRI NETS 1995 | 1995年 / 935卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Mazurkiewicz's traces combine the concepts bf formal language theory with concurrency. The class of recognizable trace languages can be characterized by means of Zielonka's finite asynchronous automaton which is representable by a labelled safe Petri net. In this paper subclasses of the recognizable trace languages are defined by restricting the structure of the automaton. The subclasses are characterized and relations between them are examined.
引用
收藏
页码：357 / 373
页数：17
相关论文
共 50 条
  • [41] Recognizable Languages of k-Forcing Automata
    Shamsizadeh, Marzieh
    Zahedi, Mohammad Mehdi
    Abolpour, Khadijeh
    De la sen, Manuel
    MATHEMATICAL AND COMPUTATIONAL APPLICATIONS, 2024, 29 (03)
  • [42] AN UPPER BOUND ON THE COMPLEXITY OF RECOGNIZABLE TREE LANGUAGES
    Finkel, Olivier
    Lecomte, Dominique
    Simonnet, Pierre
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2015, 49 (02): : 121 - 137
  • [43] Free group languages: Rational versus recognizable
    Silva, PV
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2004, 38 (01): : 49 - 67
  • [44] Minimal equational representations of recognizable tree languages
    Fulop, Z
    Vagvolgyi, S
    ACTA INFORMATICA, 1997, 34 (01) : 59 - 84
  • [45] Weighted Languages Recognizable by Weighted Tree Automata
    Fulop, Zoltan
    Gazdag, Zsolt
    ACTA CYBERNETICA, 2018, 23 (03): : 867 - 886
  • [46] A NEW CHARACTERIZATION OF NONDETERMINISTICALLY RECOGNIZABLE FAMILIES OF LANGUAGES
    WANG, CH
    CHINESE ANNALS OF MATHEMATICS SERIES B, 1991, 12 (01) : 1 - 12
  • [47] On the topological complexity of weakly recognizable tree languages
    Duparc, Jacques
    Murlak, Filip
    FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2007, 4639 : 261 - +
  • [48] Minimal equational representations of recognizable tree languages
    Zoltán Fülöp
    Sándor Vágvölgyi
    Acta Informatica, 1997, 34 : 59 - 84
  • [49] On Recognizable Tree Languages Beyond the Borel Hierarchy
    Finkel, Olivier
    Simonnet, Pierre
    FUNDAMENTA INFORMATICAE, 2009, 95 (2-3) : 287 - 303
  • [50] A NEW CHARACTERIZATION OF NONDETERMINISTICALLY RECOGNIZABLE FAMILIES OF LANGUAGES**
    王传洪
    ChineseAnnalsofMathematics, 1991, (01) : 1 - 12
12345