Abstract
We investigate the (non)-existence of universal automata for some classes of automata, such as finite automata and pushdown automata, and in particular the influence of the representation and encoding function. An alternative approach, using transition systems, is presented too.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 callMore From: Electronic proceedings in theoretical computer science
Paper Title
Journal
Date
