On the structure of recognizable languages of dependence graphs
DOI10.1051/ITA/1993270100071zbMATH Open0787.68060OpenAlexW165983MaRDI QIDQ5286052FDOQ5286052
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
Recommendations
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)
Cites Work
- Combinatorial problems of commutation and rearrangements
- Title not available (Why is that?)
- Title not available (Why is that?)
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Theory of traces
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Traces, dependency graphs and DNLC grammars
- Trace languages defined by regular string languages
Cited In (5)
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)