Pál Dömösi

According to our database, Pál Dömösi authored at least 49 papers between 1972 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2023

Simple chain automaton random number generator for IoT devices.

Pál Dömösi, Géza Horváth, Norbert Tihanyi

Acta Informatica, September, 2023

2022

Preface.

Erzsébet Csuhaj-Varjú, Pál Dömösi, György Vaszil

Int. J. Found. Comput. Sci., 2022

A Finite-Automaton Based Stream Cipher As a Quasigroup Based Cipher.

Pál Dömösi, Adama Diene

Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022

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 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

2019

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

2017

Statistical Analysis of DH1 Cryptosystem.

Pál Dömösi, József Gáll, Géza Horváth, Norbert Tihanyi

Acta Cybern., 2017

2016

On Chomsky Hierarchy of Palindromic Languages.

Pál Dömösi, Szilárd Zsolt Fazekas, Masami Ito

Acta Cybern., 2016

2015

A Novel Cryptosystem Based on Gluskov Product of Automata.

Pál Dömösi, Géza Horváth

Acta Cybern., 2015

2014

Some Results on Bounded Context-Free Languages.

Pál Dömösi, Szilárd Zsolt Fazekas, Zita Kovács

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2012

Preface.

Pál Dömösi, Zoltán Ésik

Int. J. Found. Comput. Sci., 2012

2011

On α 2 - ν 2-products of automata.

Pál Dömösi, György Maróti

Acta Informatica, 2011

2010

Parsing by Simple Insertion Systems.

Gemma Bel Enguix, Pál Dömösi, Alexander Krassovitskiy

Proceedings of the ICAART 2010 - Proceedings of the International Conference on Agents and Artificial Intelligence, Volume 2, 2010

2009

On the Shyr-Yu theorem.

Pál Dömösi, Géza Horváth, Laurent Vuillon

Theor. Comput. Sci., 2009

Automata Networks without any Letichevsky Criteria.

Pál Dömösi

Proceedings of the Automata, Formal Languages, and Related Topics, 2009

2008

Marcus contextual languages consisting of primitive words.

Pál Dömösi, Masami Ito, Solomon Marcus

Discret. Math., 2008

2006

Alternative proof of the Lyndon-Schützenberger Theorem.

Pál Dömösi, Géza Horváth

Theor. Comput. Sci., 2006

2005

New Iteration Lemmata for Regular Languages.

Pál Dömösi, Manfred Kudlek

Fundam. Informaticae, 2005

The Language of Primitive Words in not Regular: Two Simple Proofs.

Pál Dömösi, Géza Horváth

Bull. EATCS, 2005

Algebraic theory of automata networks - an introduction.

Pál Dömösi, Chrystopher L. Nehaniv

SIAM monographs on discrete mathematics and applications 11, SIAM, ISBN: 978-0-89871-569-9, 2005

2004

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

Proceedings of the Theory Is Forever, 2004

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

Theor. Comput. Sci., 2003

Some Remarks on Primitive Words and Palindromes.

Pál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura

Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2001

Homomorphic Simulation and Letichevsky's Criterion.

Pál Dömösi, Zoltán Ésik

J. Autom. Lang. Comb., 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

Multiple keyword patterns in context-free languages.

Pál Dömösi, Masami Ito

Proceedings of the Where Mathematics, 2001

On Complete Classes of Directed Graphs.

Pál Dömösi

Proceedings of the Words, Semigroups, and Transductions, 2001

2000

On complete systems of automata.

Pál Dömösi, Chrystopher L. Nehaniv

Theor. Comput. Sci., 2000

Unusual Algorithms for Lexicographical Enumeration.

Pál Dömösi

Acta Cybern., 2000

An Improvement of Iteration Lemmata for Context-free Languages.

Pál Dömösi, Manfred Kudlek

Proceedings of the International Colloquium on Words, 2000

A Parsing Problem for Context-Sensitive Languages.

Pál Dömösi, Masami Ito

Proceedings of the International Colloquium on Words, 2000

On Slender Context-Free Languages.

Pál Dömösi, Alexandru Mateescu

Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

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

Complete Finite Automata Network Graphs with Minimal Number of Edges.

Pál Dömösi, Chrystopher L. Nehaniv

Acta Cybern., 1999

Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages.

Pál Dömösi, Manfred Kudlek

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1996

A New Pumping Property of Context-Free Language.

Pál Dömösi, Masami Ito, Masashi Katsura, Chrystopher L. Nehaniv

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1993

Formal Languages Consisting of Primitive Words.

Pál Dömösi, Sándor Horváth, Masami Ito, László Kászonyi, Masashi Katsura

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1990

Product hierarchies of automata and homomorphic simulation.

Pál Dömösi, Zoltán Ésik

Acta Cybern., 1990

1989

On Product Hierarchies of Automata.

Pál Dömösi, Zoltán Ésik, Balázs Imreh

Proceedings of the Fundamentals of Computation Theory, 1989

1988

Critical Classes for the alpha_0-Product.

Pál Dömösi, Zoltán Ésik

Theor. Comput. Sci., 1988

On homomorphic simulation of automata by α₀-products.

Pál Dömösi, Zoltán Ésik

Acta Cybern., 1988

On the hierarchy of νⁱ-product.

Pál Dömösi, Zoltán Ésik

Acta Cybern., 1988

1986

Complete Classes of Automata for the alpha-0-Product.

Zoltán Ésik, Pál Dömösi

Theor. Comput. Sci., 1986

Homomorphic Realizations of Automata with Compositions.

Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1983

On ν_i-products of automata.

Pál Dömösi, Balázs Imreh

Acta Cybern., 1983

On homomorphically α_i-complete systems of automata.

Pál Dömösi

Acta Cybern., 1983

1976

On minimal R-complete systems of finite automata.

Pál Dömösi

Acta Cybern., 1976

On superpositions of automata.

Pál Dömösi

Acta Cybern., 1976

1972

On the semigroup of automaton mappings with finite alphabet.

Pál Dömösi

Acta Cybern., 1972