Context-sensitive and context-free vectors of PD-coroutines languages
From MaRDI portal
Publication:760792
zbMATH Open0555.68006MaRDI QIDQ760792FDOQ760792
Publication date: 1984
Published in: Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)
Recommendations
- Analysis of vectors of coroutines by means of trees π π
- The context-freeness of the languages associated with vector addition systems is decidable π π
- On the Context-Freeness Problem for Vector Addition Systems π π
- Automata, Languages and Programming π π
- Vector grammars and PN machines π π
This page was built for publication: Context-sensitive and context-free vectors of PD-coroutines languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760792)