Decidability of the reachability problem for pushdown relational automata
From MaRDI portal
Publication:1057653
zbMath0563.68047MaRDI QIDQ1057653
Publication date: 1984
Published in: Programming and Computer Software (Search for Journal in Brave)
Decidability (number-theoretic aspects) (11U05) Specification and verification (program logics, model checking, etc.) (68Q60) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
This page was built for publication: Decidability of the reachability problem for pushdown relational automata