The totality problem for program schemas

DOI10.1007/BF01072151zbMath0562.68015OpenAlexW2055073876MaRDI QIDQ3675509

V. A. Nepomnyashchij

Publication date: 1983

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01072151

zbMATH Keywords

monadic schemasone-way nondeterministic stack automatasolubility of totality problems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• On formalised computer programs
• Intercalation theorems for stack languages

This page was built for publication: The totality problem for program schemas