On the structure of recognizable languages of dependence graphs
From MaRDI portal
Publication:5286052
Recommendations
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)