On the semigroup of automaton mappings with finite alphabet. - Pál Dömösi (Acta Cybern., 1972)

On superpositions of automata. - Pál Dömösi (Acta Cybern., 1976)

On minimal R-complete systems of finite automata. - Pál Dömösi (Acta Cybern., 1976)

On homomorphically αi-complete systems of automata. - Pál Dömösi (Acta Cybern., 1983)

On νi-products of automata. - Pál Dömösi; Balázs Imreh (Acta Cybern., 1983)

Homomorphic Realizations of Automata with Compositions. - Zoltán Ésik; Pál Dömösi; Ferenc Gécseg; J. Virágh (MFCS, 1986)

Complete Classes of Automata for the alpha-0-Product. - Zoltán Ésik; Pál Dömösi (Theor. Comput. Sci., 1986)

On the hierarchy of νi-product. - Pál Dömösi; Zoltán Ésik (Acta Cybern., 1988)

On homomorphic simulation of automata by α0-products. - Pál Dömösi; Zoltán Ésik (Acta Cybern., 1988)

Critical Classes for the alpha_0-Product. - Pál Dömösi; Zoltán Ésik (Theor. Comput. Sci., 1988)

On Product Hierarchies of Automata. - Pál Dömösi; Zoltán Ésik; Balázs Imreh (FCT, 1989)

Product hierarchies of automata and homomorphic simulation. - Pál Dömösi; Zoltán Ésik (Acta Cybern., 1990)

Formal Languages Consisting of Primitive Words. - Pál Dömösi; Sándor Horváth; Masami Ito; László Kászonyi; Masashi Katsura (FCT, 1993)

A New Pumping Property of Context-Free Language. - Pál Dömösi; Masami Ito; Masashi Katsura; Chrystopher L. Nehaniv (DMTCS, 1996)

Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages. - Pál Dömösi; Manfred Kudlek (FCT, 1999)

Complete Finite Automata Network Graphs with Minimal Number of Edges. - Pál Dömösi; Chrystopher L. Nehaniv (Acta Cybern., 1999)

A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear Languages. - Pál Dömösi; Satoshi Okawa; Sadaki Hirose (Bull. EATCS, 1999)

On Slender Context-Free Languages. - Pál Dömösi; Alexandru Mateescu (Recent Topics in Mathematical and Computational Linguistics, 2000)

A Parsing Problem for Context-Sensitive Languages. - Pál Dömösi; Masami Ito (Words, Languages & Combinatorics, 2000)

An Improvement of Iteration Lemmata for Context-free Languages. - Pál Dömösi; Manfred Kudlek (Words, Languages & Combinatorics, 2000)

Unusual Algorithms for Lexicographical Enumeration. - Pál Dömösi (Acta Cybern., 2000)

On complete systems of automata. - Pál Dömösi; Chrystopher L. Nehaniv (Theor. Comput. Sci., 2000)

On Complete Classes of Directed Graphs. - Pál Dömösi (Words, Semigroups, and Transductions, 2001)

Multiple keyword patterns in context-free languages. - Pál Dömösi; Masami Ito (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages. - Pál Dömösi; Satoshi Okawa (Acta Cybern., 2001)

Homomorphic Simulation and Letichevsky's Criterion. - Pál Dömösi; Zoltán Ésik (J. Autom. Lang. Comb., 2001)

Some Remarks on Primitive Words and Palindromes. - Pál Dömösi; Sándor Horváth; Masami Ito; Masashi Katsura (DCFS, 2003)

Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. - Pál Dömösi; Chrystopher L. Nehaniv; John L. Rhodes 001 (Theor. Comput. Sci., 2003)

Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages. - Pál Dömösi; Carlos Martín-Vide; Victor Mitrana (Theory Is Forever, 2004)

Algebraic theory of automata networks - an introduction. - Pál Dömösi; Chrystopher L. Nehaniv (SIAM, 2005)

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

New Iteration Lemmata for Regular Languages. - Pál Dömösi; Manfred Kudlek (Fundam. Informaticae, 2005)

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

Automata Networks without any Letichevsky Criteria. - Pál Dömösi (LATA, 2007)

Marcus contextual languages consisting of primitive words. - Pál Dömösi; Masami Ito; Solomon Marcus (Discret. Math., 2008)

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

Parsing by Simple Insertion Systems. - Gemma Bel Enguix; Pál Dömösi; Alexander Krassovitskiy (ICAART (2), 2010)

On α 2 - ν 2-products of automata. - Pál Dömösi; György Maróti (Acta Informatica, 2011)

Preface. - Pál Dömösi; Zoltán Ésik (Int. J. Found. Comput. Sci., 2012)

Some Results on Bounded Context-Free Languages. - Pál Dömösi; Szilárd Zsolt Fazekas; Zita Kovács (Discrete Mathematics and Computer Science, 2014)

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

On Chomsky Hierarchy of Palindromic Languages. - Pál Dömösi; Szilárd Zsolt Fazekas; Masami Ito (Acta Cybern., 2016)

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)

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)

A Finite-Automaton Based Stream Cipher As a Quasigroup Based Cipher. - Pál Dömösi; Adama Diene (NCMA, 2022)

Preface. - Erzsébet Csuhaj-Varjú; Pál Dömösi; György Vaszil (Int. J. Found. Comput. Sci., 2022)

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