Pál Dömösi

dblp:84/253 · DBLP profile ↗
← Back
15ranked-venue papers
12as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 14 · 12 first-author · 1 since 2021Artificial intelligence and machine learning · 1
YearPublicationVenuePosition
2023 Simple chain automaton random number generator for IoT devices
abstract
Abstract Random numbers are very important in many fields of computer science. Generating high-quality random numbers using only basic arithmetic operations is challenging, especially for devices with limited hardware capabilities, such as Internet of Things (IoT) devices. In this paper, we present a novel pseudorandom number generator, the simple chain automaton random number generator (SCARNG), based on compositions of abstract automata. The main advantage of the presented algorithm is its simple structure that can be implemented easily for very low computing capacity IoT systems, FPGAs or GPU hardware. The generated random numbers demonstrate promising statistical behavior and satisfy the NIST statistical suite requirements, highlighting the potential of the SCARNG for practical applications.
Pál Dömösi, Géza Horváth, Norbert Tihanyi
Acta Informatica1
2011 On α 2 - ν 2-products of automata
Pál Dömösi, György Maróti
Acta Informatica1
2010 Parsing by Simple Insertion Systems
Gemma Bel Enguix, Pál Dömösi, Alexander Krassovitskiy
ICAART (2)2
2009 On the Shyr-Yu theorem
Pál Dömösi, Géza Horváth, Laurent Vuillon
Theor. Comput. Sci.1
2007 Automata Networks without any Letichevsky Criteria
Pál Dömösi
LATA1
2006 Alternative proof of the Lyndon-Schützenberger Theorem
Pál Dömösi, Géza Horváth
Theor. Comput. Sci.1
2005 New Iteration Lemmata for Regular Languages
Pál Dömösi, Manfred Kudlek
Fundam. Informaticae1
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 0001
Theor. Comput. Sci.1
2000 On complete systems of automata
Pál Dömösi, Chrystopher L. Nehaniv
Theor. Comput. Sci.1
1999 Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages
Pál Dömösi, Manfred Kudlek
FCT1
1993 Formal Languages Consisting of Primitive Words
Pál Dömösi, Sándor Horváth, Masami Ito, László Kászonyi, Masashi Katsura
FCT1
1989 On Product Hierarchies of Automata
Pál Dömösi, Zoltán Ésik, Balázs Imreh
FCT1
1988 Critical Classes for the alpha_0-Product
Pál Dömösi, Zoltán Ésik
Theor. Comput. Sci.1
1986 Homomorphic Realizations of Automata with Compositions
Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh
MFCS2
1986 Complete Classes of Automata for the alpha-0-Product
Zoltán Ésik, Pál Dömösi
Theor. Comput. Sci.2