The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine

From MaRDI portal
Publication:1158757

DOI10.1016/0022-0000(81)90072-6zbMath0473.68046OpenAlexW2051999169MaRDI QIDQ1158757

Namio Honda, Yasuyoshi Inagaki, Michio Oyamaguchi

Publication date: 1981

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(81)90072-6



Related Items



Cites Work