Pál Dömösi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 47 from 47

2023

Simple chain automaton random number generator for IoT devicesPál Dömösi, Géza Horváth, Norbert Tihanyi. ACTA, 60(3):317-329, September 2023. [doi]

2022

PrefaceErzsébet Csuhaj-Varjú, Pál Dömösi, György Vaszil. ijfcs, 33(3&4):175-178, 2022. [doi]

2021

A Pseudorandom number Generator with Full Cycle Length based on Automata CompositionsBertalan Borsos, Pál Dömösi, Yousef AlHammadi, Norbert Tihanyi, József Gáll, Géza Horváth. informaticaSI, 45(1), 2021. [doi]

A Full Cycle Length Pseudorandom Number Generator Based on Compositions of AutomataBertalan Borsos, Pál Dömösi, Yousef AlHammadi, Norbert Tihanyi, József Gáll, Géza Horváth. informaticaSI, 45(2), 2021. [doi]

2019

Some Remarks and Tests on the Dh1 Cryptosystem Based on Automata CompositionsPál Dömösi, József Gáll, Géza Horváth, Norbert Tihanyi. informaticaSI, 43(2), 2019. [doi]

2017

Statistical Analysis of DH1 CryptosystemPál Dömösi, József Gáll, Géza Horváth, Norbert Tihanyi. actaC, 23(1):371-378, 2017. [doi]

2016

On Chomsky Hierarchy of Palindromic LanguagesPál Dömösi, Szilárd Zsolt Fazekas, Masami Ito. actaC, 22(3):703-713, 2016. [doi]

2015

A Novel Cryptosystem Based on Gluskov Product of AutomataPál Dömösi, Géza Horváth. actaC, 22(2):359-371, 2015. [doi]

2014

Some Results on Bounded Context-Free LanguagesPál Dömösi, Szilárd Zsolt Fazekas, Zita Kovács. BIRTHDAY 2014: 119-136

2012

PrefacePál Dömösi, Zoltán Ésik. ijfcs, 23(6):1185-1188, 2012. [doi]

2011

On α 2 - ν 2-products of automataPál Dömösi, György Maróti. ACTA, 48(7-8):397-408, 2011. [doi]

2009

Automata Networks without any Letichevsky CriteriaPál Dömösi. birthday 2009: 39-54

2008

Marcus contextual languages consisting of primitive wordsPál Dömösi, Masami Ito, Solomon Marcus. DM, 308(21):4877-4881, 2008. [doi]

2007

Automata Networks without any Letichevsky CriteriaPál Dömösi. LATA 2007: 237-248

2006

Alternative proof of the Lyndon-Schützenberger TheoremPál Dömösi, Géza Horváth. TCS, 366(3):194-198, 2006. [doi]

2005

The Language of Primitive Words in not Regular: Two Simple ProofsPál Dömösi, Géza Horváth. eatcs, 87:191-194, 2005.

New Iteration Lemmata for Regular LanguagesPál Dömösi, Manfred Kudlek. FUIN, 64(1-4):151-157, 2005. [doi]

Algebraic theory of automata networks - an introductionPál Dömösi, Chrystopher L. Nehaniv. Volume 11 of SIAM monographs on discrete mathematics and applications, SIAM, 2005.

2004

Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free LanguagesPál Dömösi, Carlos Martín-Vide, Victor Mitrana. BIRTHDAY 2004: 60-67 [doi]

2003

Some Remarks on Primitive Words and PalindromesPál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura. dcfs 2003: 245-254

Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automataPál Dömösi, Chrystopher L. Nehaniv, John L. Rhodes. TCS, 302(1-3):295-317, 2003. [doi]

2001

On Complete Classes of Directed GraphsPál Dömösi. BIRTHDAY 2001: 69-79

Homomorphic Simulation and Letichevsky s CriterionPál Dömösi, Zoltán Ésik. jalc, 6(4):427-436, 2001.

A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free LanguagesPál Dömösi, Satoshi Okawa. actaC, 15(1):25-32, 2001. [doi]

Multiple keyword patterns in context-free languagesPál Dömösi, Masami Ito. BIRTHDAY 2001: 237-241

2000

1999

Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed LanguagesPál Dömösi, Manfred Kudlek. fct 1999: 226-233 [doi]

A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear LanguagesPál Dömösi, Satoshi Okawa, Sadaki Hirose. eatcs, 68:151, 1999.

Complete Finite Automata Network Graphs with Minimal Number of EdgesPál Dömösi, Chrystopher L. Nehaniv. actaC, 14(1):37-50, 1999. [doi]

1996

A New Pumping Property of Context-Free LanguagePál Dömösi, Masami Ito, Masashi Katsura, Chrystopher L. Nehaniv. dmtcs 1996: 187-193

1993

Formal Languages Consisting of Primitive WordsPál Dömösi, Sándor Horváth, Masami Ito, László Kászonyi, Masashi Katsura. fct 1993: 194-203

1990

Product hierarchies of automata and homomorphic simulationPál Dömösi, Zoltán Ésik. actaC, 9(4):371-373, 1990.

1989

On Product Hierarchies of AutomataPál Dömösi, Zoltán Ésik, Balázs Imreh. fct 1989: 137-144

1988

On homomorphic simulation of automata by alpha:::i:::-producstPál Dömösi, Zoltán Ésik. actaC, 8:315-323, 1988.

Critical Classes for the alpha_0-ProductPál Dömösi, Zoltán Ésik. TCS, 61:17-24, 1988.

On the hiearchy of nu:::i:::-productPál Dömösi, Zoltán Ésik. actaC, 8:253-257, 1988.

1986

Complete Classes of Automata for the alpha-0-ProductZoltán Ésik, Pál Dömösi. TCS, 47(3):1-14, 1986.

Homomorphic Realizations of Automata with CompositionsZoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh. mfcs 1986: 299-307

1983

On homomorphically alpha::i::-complete systems of automataPál Dömösi. actaC, 6:85-88, 1983.

On nu::i::-products of automataPál Dömösi, Balázs Imreh. actaC, 6:149-162, 1983.

1977

On minimal R-complete systems of finite automataPál Dömösi. actaC, 3:37-41, 1977.

1976

On superpositions of automataPál Dömösi. actaC, 2:335-343, 1976.

1972

On the semigroup of automaton mappings with finite alphabetPál Dömösi. actaC, 1:251-254, 1972.

Sign in or sign up to see more results.

runs on WebDSL