Context-sensitive and context-free vectors of PD-coroutines languages

MaRDI QIDQ760792zbMATH OpenFDO

Authors Eugeniusz Eberbach

Publication date 1984

Published in Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)

zbMATH Keywords

coroutine programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Review text

Properties of vectors of PD-coroutines (a formal model for a wide class of coroutine programs) are considered. In the paper two new decidable subclasses of all vectors of PD-coroutines are defined, namely context- sensitive and context-free vectors of PD-coroutines.

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

Cited in

(1)

• Analysis of vectors of coroutines by means of trees

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)