Some more algorithms for Conway’s universal automaton

Open access

Abstract

In this paper authors propose algorithms for constructing so called automaton COM(L) and prove that this automaton coincides, up to re-denoting states, with Conway’s universal automaton. We give some algorithms of constructing this automaton and consider some examples.

[1] A.Aho, J.Ullman, The Theory of Parsing, Translation, and Compiling, Vol. 1, Parsing. Prentice Hall, 1972. ⇒8

[2] R.Dedekind, Über Zerlegungen von Zahlen durch ihre größten gemeinsamen Teiler. Gesammelte Werke, Vol. 2, 103-148. ⇒18

[3] T.Kameda, P.Weiner, On the state minimization of nondeterministic finite automata, IEEE Trans. on Comp. C-19, 7 (1970) 617-627. ⇒20

[4] S. Lombardy, J. Sakarovitch, The Universal Automaton, in: Logic and Automata, Texts in Logic and Games Amsterdam Univ. Press. Vol. 2 (2008) 457-504. ⇒ 5, 7, 18

[5] B.Melnikov, Extended nondeterministic finite automata, Fundamenta Informaticae 104, 3 (2010) 255-265. ⇒5, 6

[6] B.Melnikov, Once more on the edge-minimization of nondeterministic finite automata and the connected problems, Fundamenta Informaticae 104, 3 (2010) 267-283. ⇒5, 6, 9, 10, 13, 14

[7] B.Melnikov, A. Melnikova, Some more on the basis finite automaton, Acta Univ. Sapientiae, Inform. 5, 2 (2013) 227-244 ⇒19

[8] B.Melnikov, N. Sciarini-Guryanova, Possible edges of a finite automaton defining a given regular language, The Korean Journal of Computational and Applied Mathematics 9, 2 (2002) 475-485. ⇒5

Acta Universitatis Sapientiae, Informatica

The Journal of "Sapientia" Hungarian University of Transylvania

Journal Information

Metrics

All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 70 70 13
PDF Downloads 15 15 3