Pál Dömösi

Publication Activity (10 Years)

Years Active: 1972-2023
Publications (10 Years): 8

Top Topics

Finite Automaton

Statistical Analysis

Context Free Languages

Top Venues

Informatica (Slovenia)

Discrete Mathematics and Computer Science

Publications

Pál Dömösi, Géza Horváth, Norbert Tihanyi
Simple chain automaton random number generator for IoT devices. Acta Informatica 60 (3) (2023)
Erzsébet Csuhaj-Varjú, Pál Dömösi, György Vaszil
Preface. Int. J. Found. Comput. Sci. 33 (3&4) (2022)
Pál Dömösi, Adama Diene
A Finite-Automaton Based Stream Cipher As a Quasigroup Based Cipher. NCMA (2022)
Bertalan Borsos, Pál Dömösi, Yousef AlHammadi, Norbert Tihanyi, József Gáll, Géza Horváth
A Pseudorandom number Generator with Full Cycle Length based on Automata Compositions. Informatica (Slovenia) 45 (1) (2021)
Bertalan Borsos, Pál Dömösi, Yousef AlHammadi, Norbert Tihanyi, József Gáll, Géza Horváth
A Full Cycle Length Pseudorandom Number Generator Based on Compositions of Automata. Informatica (Slovenia) 45 (2) (2021)
Pál Dömösi, József Gáll, Géza Horváth, Norbert Tihanyi
Some Remarks and Tests on the Dh1 Cryptosystem Based on Automata Compositions. Informatica (Slovenia) 43 (2) (2019)
Pál Dömösi, József Gáll, Géza Horváth, Norbert Tihanyi
Statistical Analysis of DH1 Cryptosystem. Acta Cybern. 23 (1) (2017)
Pál Dömösi, Szilárd Zsolt Fazekas, Masami Ito
On Chomsky Hierarchy of Palindromic Languages. Acta Cybern. 22 (3) (2016)
Pál Dömösi, Géza Horváth
A Novel Cryptosystem Based on Gluskov Product of Automata. Acta Cybern. 22 (2) (2015)
Pál Dömösi, Szilárd Zsolt Fazekas, Zita Kovács
Some Results on Bounded Context-Free Languages. Discrete Mathematics and Computer Science (2014)
Pál Dömösi, Zoltán Ésik
Preface. Int. J. Found. Comput. Sci. 23 (6) (2012)
Pál Dömösi, György Maróti
On α 2 - ν 2-products of automata. Acta Informatica 48 (7-8) (2011)
Gemma Bel Enguix, Pál Dömösi, Alexander Krassovitskiy
Parsing by Simple Insertion Systems. ICAART (2) (2010)
Pál Dömösi, Géza Horváth, Laurent Vuillon
On the Shyr-Yu theorem. Theor. Comput. Sci. 410 (47-49) (2009)
Pál Dömösi
Automata Networks without any Letichevsky Criteria. Automata, Formal Languages, and Related Topics (2009)
Pál Dömösi, Masami Ito, Solomon Marcus
Marcus contextual languages consisting of primitive words. Discret. Math. 308 (21) (2008)
Pál Dömösi
Automata Networks without any Letichevsky Criteria. LATA (2007)
Pál Dömösi, Géza Horváth
Alternative proof of the Lyndon-Schützenberger Theorem. Theor. Comput. Sci. 366 (3) (2006)
Pál Dömösi, Géza Horváth
The Language of Primitive Words in not Regular: Two Simple Proofs. Bull. EATCS 87 (2005)
Pál Dömösi, Manfred Kudlek
New Iteration Lemmata for Regular Languages. Fundam. Informaticae 64 (1-4) (2005)
Pál Dömösi, Carlos Martín-Vide, Victor Mitrana
Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages. Theory Is Forever (2004)
Pál Dömösi, Chrystopher L. Nehaniv, John L. Rhodes
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. Theor. Comput. Sci. 302 (1-3) (2003)
Pál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura
Some Remarks on Primitive Words and Palindromes. DCFS (2003)
Pál Dömösi, Zoltán Ésik
Homomorphic Simulation and Letichevsky's Criterion. J. Autom. Lang. Comb. 6 (4) (2001)
Pál Dömösi, Satoshi Okawa
A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages. Acta Cybern. 15 (1) (2001)
Pál Dömösi
On Complete Classes of Directed Graphs. Words, Semigroups, and Transductions (2001)
Pál Dömösi, Masami Ito
Multiple keyword patterns in context-free languages. Where Mathematics, Computer Science, Linguistics and Biology Meet (2001)
Pál Dömösi, Masami Ito
A Parsing Problem for Context-Sensitive Languages. Words, Languages & Combinatorics (2000)
Pál Dömösi, Manfred Kudlek
An Improvement of Iteration Lemmata for Context-free Languages. Words, Languages & Combinatorics (2000)
Pál Dömösi, Alexandru Mateescu
On Slender Context-Free Languages. Recent Topics in Mathematical and Computational Linguistics (2000)
Pál Dömösi
Unusual Algorithms for Lexicographical Enumeration. Acta Cybern. 14 (3) (2000)
Pál Dömösi, Chrystopher L. Nehaniv
On complete systems of automata. Theor. Comput. Sci. 245 (1) (2000)
Pál Dömösi, Satoshi Okawa, Sadaki Hirose
A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear Languages. Bull. EATCS 68 (1999)
Pál Dömösi, Manfred Kudlek
Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages. FCT (1999)
Pál Dömösi, Chrystopher L. Nehaniv
Complete Finite Automata Network Graphs with Minimal Number of Edges. Acta Cybern. 14 (1) (1999)
Pál Dömösi, Masami Ito, Masashi Katsura, Chrystopher L. Nehaniv
A New Pumping Property of Context-Free Language. DMTCS (1996)
Pál Dömösi, Sándor Horváth, Masami Ito, László Kászonyi, Masashi Katsura
Formal Languages Consisting of Primitive Words. FCT (1993)
Pál Dömösi, Zoltán Ésik
Product hierarchies of automata and homomorphic simulation. Acta Cybern. 9 (4) (1990)
Pál Dömösi, Zoltán Ésik, Balázs Imreh
On Product Hierarchies of Automata. FCT (1989)
Pál Dömösi, Zoltán Ésik
-products. Acta Cybern. 8 (4) (1988)
Pál Dömösi, Zoltán Ésik
-product. Acta Cybern. 8 (3) (1988)
Pál Dömösi, Zoltán Ésik
Critical Classes for the alpha_0-Product. Theor. Comput. Sci. 61 (1988)
Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh
Homomorphic Realizations of Automata with Compositions. MFCS (1986)
Zoltán Ésik, Pál Dömösi
Complete Classes of Automata for the alpha-0-Product. Theor. Comput. Sci. 47 (3) (1986)
Pál Dömösi
-complete systems of automata. Acta Cybern. 6 (1) (1983)
Pál Dömösi, Balázs Imreh
-products of automata. Acta Cybern. 6 (2) (1983)
Pál Dömösi
On superpositions of automata. Acta Cybern. 2 (4) (1976)
Pál Dömösi
On minimal R-complete systems of finite automata. Acta Cybern. 3 (1) (1976)
Pál Dömösi
On the semigroup of automaton mappings with finite alphabet. Acta Cybern. 1 (4) (1972)