Dömösi, P., Gáll, J., Horváth, G., Borsos, B., Tihanyi, N., Al, H.: A Full Cycle Length Pseudorandom Number Generator Based on Compositions of Automata.
Informatica. 45 (2), 179-189, 2021.

Dömösi, P., Horváth, G., Molnár, F., Kovács, S., Diene, A.: A side-channel attack against an automata theory based stream cipher.
RIMS K©oky©uroku 2193 64-72, 2021.

Dömösi, P., Hannusch, C., Horváth, G.: A Cryptographic System Based on a New Class of Binary Error-Correcting Codes.
Tatra Mt. Math. Publ. 73 (1), 83-96, 2019.

Dömösi, P., Horváth, G.: Hash Functions Based on Gluškov Product of Automata.
Eleventh Workshop on Non-Classical Models of Automata and Applications (NCMA 2019) 2019 15-21, 2019.

Dömösi, P., Gáll, J., Horváth, G., Tihanyi, N.: Pseudorandom Number Generators Based on Compositions of Automata.
Proceedings of the 22nd International Multiconference INFORMATION SOCIETY 1 19-21, 2019.

Dömösi, P., Gáll, J., Horváth, G., Tihanyi, N.: Some remarks and tests on the DH1 Cryptosystem based on automata compositions.
Informatica. 43 (2), 199-207, 2019.

Dömösi, P., Horváth, G.: A Novel stream cipher based on deterministic finite automaton.
In: Ninth Workshop on Non-Classical Models of Automata and Applications (NCMA 2017) : Short Papers, [Faculty of Mathematics and Physics Charles University], [Prague], 11-16, 2017.

Dömösi, P., Gáll, J., Horváth, G., Tihanyi, N.: Statistical analysis of DH1 cryptosystem.
Acta Cybern. 23 (1), 371-378, 2017.

Dömösi, P., Gáll, J., Horváth, G., Tihanyi, N.: On NIST test of a novel cryptosystem based on automata compositions.
In: Middle-European Conference on Applied Theoretical Computer Science (MATCOS 2016) [elektronikus dokumentum] : zbornik 19. mednarodne multikonference Informacijska družba - IS 2016, 12.-13. oktober 2016, [Ljubljana, Slovenija] = proceedings of the 19th International Multiconference Information Society - IS 2016, 12.-13 October 2016, Ljubljana, Slovenia : zvezek H = volume H. Ed.: Andrej Brodnik, Institut Jožef Stefan, Ljubljana, 24-27, 2016. ISBN: 9789612641047

Dömösi, P., Horváth, G.: A novel cryptosystem based on abstract automata and Latin cubes.
Stud. Sci. Math. Hung. 52 (2), 221-232, 2015.

Dömösi, P., Horváth, G.: A novel cryptosystem based on Gluškov product of automata.
Acta Cybern. 22 (2), 359-371, 2015.

Dömösi, P., Horváth, G.: Automataelméleti alapú titkosítási rendszerek.
In: Informatika a Felsőoktatásban 2014 [elektronikus dokumentum]. Szerk.: Kunkli Roland, Papp Ildikó, Rutkovszky Edéné, DE Informatikai Kar, Debrecen, 433-442, 2014. ISBN: 9789634737124

Dömösi, P., Falucskai, J., Horváth, G., Mecsei, Z., Nagy, B.: Formális nyelvek és automaták.
Lektorált Internetes Kiadvány, Debrecen, 239 p., 2011.

Dömösi, P., Horváth, G., Vuillon, L.: On the Shyr-Yu theorem.
Theor. Comput. Sci. 410 (47-49), 4874-4877, 2009.

Dömösi, P., Horváth, G.: Alternative Proof of the Lyndod-Schützenberger Theorem.
Theor. Comput. Sci. 366 (3), 194-198, 2006.

Dömösi, P., Horváth, G., Ito, M., Shikishima-Tsuji, K.: Some Periodicity of Words and Marcus Contextual Grammars.
Vietnam J. of Math. 34 (4), 381-387, 2006.

Dömösi, P., Nehaniv, C.: Algebraic theory of automata networks: an introduction.
Society for Industrial and Applied Mathematics, Philadelphia, 258 p., 2005. ISBN: 0898715695

Dömösi, P., Horváth, G.: On Products of Primitive Words.
In: Automata and Formal Languages. Ed.: Ésik Zoltán, Fülöp Zoltán, Novadat, Szeged, 112-121, 2005.

Dömösi, P., Horváth, G.: The Language of Primitive Words is not Regular: Two Simple Proofs.
Bull. of EATCS. 87 191-197, 2005.

Dömösi, P., Horváth, G., Ito, M.: A Small Hierarchy of Languages Consisting of Non-Primitive Words.
Publ. Math., Debrecen. 64 (3-4), 261-267, 2004.

Dömösi, P., Fazekas, A., Horváth, G., Mecsei, Z.: Formális nyelvek és automaták: egyetemi jegyzet.
Lektorált Internetes Kiadvány, Debrecen, 101 p., 2003.

Dömösi, P., Hauschildt, D., Horváth, G., Kudlek, M.: Some Results on Small Context-free Grammars Generating Primitive Words.
Publ. Math., Debrecen. 54 667-686, 1999.

Dömösi, P.: On alpha2-nu3-products of automata.
Publ. math. 48 (3-4), 233-242, 1996.

Dömösi, P.: Some results on small context-free grammars generating primitive words.
Universität Hamburg. Fachbereich Informatik, Hamburg, 1996.

Dömösi, P., Kovács, B.: Computation on Networks of Automata.
In: International Colloquium on Words, Languages and Combinatorics