On the structure of recognizable languages of dependence graphs

DOI10.1051/ITA/1993270100071MaRDI QIDQ5286052zbMATH OpenOpenAlexFDO

Authors Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg

Publication date 29 June 1993

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92440

zbMATH Keywords

behaviourconcurrent systemdependence graphtheory of tracessafe Petri netRecDG language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 4047060
• Subclasses of recognizable trace languages
• scientific article; zbMATH DE number 475419
• Dependence orders for computations of concurrent automata
• Publication:4508302

Cites work

• scientific article; zbMATH DE number 3921989 (Why is no real title available?)
• scientific article; zbMATH DE number 3970130 (Why is no real title available?)
• scientific article; zbMATH DE number 4047060 (Why is no real title available?)
• scientific article; zbMATH DE number 3765179 (Why is no real title available?)
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Combinatorial problems of commutation and rearrangements
• Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science
• Theory of traces
• Trace languages defined by regular string languages
• Traces, dependency graphs and DNLC grammars
• Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif

Cited in

(5)

• scientific article; zbMATH DE number 1670715 (Why is no real title available?)
• Recognizability of graph and pattern languages
• Separating \(k\)-separated eNCE graph languages
• Complete subgraphs of bipartite graphs and applications to trace languages
• scientific article; zbMATH DE number 4047060 (Why is no real title available?)

This page was built for publication: On the structure of recognizable languages of dependence graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286052)