Pál Dömösi

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