Abstract
A natural and sufficiently large class of deterministic one-way multitape automa is defined with decidable inclusion problem. This class is also the largest with decidable equivalence problem at this moment.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
