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 条
  • [31] Context-sensitive string languages and recognizable picture languages
    Latteux, M
    Simplot, D
    INFORMATION AND COMPUTATION, 1997, 138 (02) : 160 - 169
  • [32] Classification of String Languages via Tiling Recognizable Picture Languages
    Anselmo, Marcella
    Giammarresi, Dora
    Madonia, Maria
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2011, 6638 : 105 - +
  • [33] Inferring subclasses of contextual languages
    Emerald, JD
    Subramanian, KG
    Thomas, DG
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, 2000, 1891 : 65 - 74
  • [34] Regular splicing languages and subclasses
    Bonizzoni, P
    Mauri, G
    THEORETICAL COMPUTER SCIENCE, 2005, 340 (02) : 349 - 363
  • [35] Recognizable vs. regular picture languages
    Matz, Oliver
    ALGEBRAIC INFORMATICS, 2007, 4728 : 112 - 121
  • [36] Recognizable iso-triangular picture languages
    Bhuvaneswari, K.
    Kalyani, T.
    ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2019, (42): : 436 - 448
  • [37] Unambiguous recognizable two-dimensional languages
    Anselmo, Marcella
    Giammarresi, Dora
    Madonia, Maria
    Restivo, Antonio
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2006, 40 (02): : 277 - 293
  • [38] A Generalized Pumping Lemma for Weighted Recognizable Languages
    Maletti, Andreas
    Nuernbergk, Nils Oskar
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,
  • [39] Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages
    Kobele, Gregory M.
    LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS, LACL 2011, 2011, 6736 : 129 - 144
  • [40] Recognizable Languages of k-Forcing Automata
    Shamsizadeh, Marzieh
    Zahedi, Mohammad Mehdi
    Abolpour, Khadijeh
    De la sen, Manuel
    MATHEMATICAL AND COMPUTATIONAL APPLICATIONS, 2024, 29 (03)
12345