Regularity and Size of Set Automata
The descriptional complexity of deterministic and nondeterministic set automata is investigated. Set automata are basically finite automata equipped with a set as an additional storage medium. The basic operations on the set are the insertion of elements, the removing of elements, and the test whether or not an element is in the set. We show that regularity is decidable for deterministic set automata and describe a conversion procedure into deterministic finite automata which leads to a double exponential upper bound. This bound is proved to be tight in the order of magnitude by presenting also a double exponential lower bound. In contrast to these recursive bounds we obtain non-recursive trade-offs when nondeterministic set automata are considered.
Unable to display preview. Download preview PDF.
- 4.Holzer, M., Kutrib, M.: Descriptional complexity – An introductory survey. In: Martín-Vide, C. (ed.) Scientific Applications of Language Methods, pp. 1–58. Imperial College Press (2010)Google Scholar
- 6.Kutrib, M., Malcher, A., Wendlandt, M.: Deterministic set automata. In: Developments in Language Theory (DLT 2014). LNCS. Springer (2014)Google Scholar
- 7.Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: Symposium on Switching and Automata Theory (SWAT 1971), pp. 188–191. IEEE (1971)Google Scholar