Visualization of Cellular Automata. - Maria Demeny; Géza Horváth; Csaba Nagylaki; Zoltan Nagylaki (Words, Languages & Combinatorics, 2000)

The Language of Primitive Words in not Regular: Two Simple Proofs. - Pál Dömösi; Géza Horváth (Bull. EATCS, 2005)

Alternative proof of the Lyndon-Schützenberger Theorem. - Pál Dömösi; Géza Horváth (Theor. Comput. Sci., 2006)

On the Shyr-Yu theorem. - Pál Dömösi; Géza Horváth; Laurent Vuillon (Theor. Comput. Sci., 2009)

Pumping lemmas for linear and nonlinear context-free languages - Géza Horváth; Benedek Nagy (CoRR, 2010)

End-to-end QoS management across LTE networks. - Géza Horváth (SoftCOM, 2013)

A Novel Cryptosystem Based on Gluskov Product of Automata. - Pál Dömösi; Géza Horváth (Acta Cybern., 2015)

Statistical Analysis of DH1 Cryptosystem. - Pál Dömösi; József Gáll; Géza Horváth; Norbert Tihanyi (Acta Cybern., 2017)

Some Remarks and Tests on the Dh1 Cryptosystem Based on Automata Compositions. - Pál Dömösi; József Gáll; Géza Horváth; Norbert Tihanyi (Informatica (Slovenia), 2019)

Statistical Analysis of Hexagonal and Triangular Game of Life. - Erik Zoltán Hidi; Géza Horváth; Dávid Petrik (ICAI, 2020)

A Full Cycle Length Pseudorandom Number Generator Based on Compositions of Automata. - Bertalan Borsos; Pál Dömösi; Yousef AlHammadi; Norbert Tihanyi; József Gáll; Géza Horváth (Informatica (Slovenia), 2021)

A Pseudorandom number Generator with Full Cycle Length based on Automata Compositions. - Bertalan Borsos; Pál Dömösi; Yousef AlHammadi; Norbert Tihanyi; József Gáll; Géza Horváth (Informatica (Slovenia), 2021)

Properties of Hash Functions based on Gluškov Product of Automata. - Carolin Hannusch; Géza Horváth (J. Autom. Lang. Comb., 2021)

Simple chain automaton random number generator for IoT devices. - Pál Dömösi; Géza Horváth; Norbert Tihanyi (Acta Informatica, 2023)