On the Existence of Universal Finite or Pushdown Automata
Formal Languages and Automata Theory
2012-08-01 v1
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.
Cite
@article{arxiv.1207.7149,
title = {On the Existence of Universal Finite or Pushdown Automata},
author = {Manfred Kudlek},
journal= {arXiv preprint arXiv:1207.7149},
year = {2012}
}
Comments
In Proceedings DCM 2011, arXiv:1207.6821. Sadly, Manfred Kudlek passed away June 18, 2012, before publication of this paper