On the Existence of Universal Finite or Pushdown Automata
Manfred Kudlek
Electronic Proceedings in Theoretical Computer Science · 2012
doi:10.4204/eptcs.88.7 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.