Pál Dömösi
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2017
- [j27]Pál Dömösi, József Gáll, Géza Horváth, Norbert Tihanyi:
Statistical Analysis of DH1 Cryptosystem. Acta Cybern. 23(1): 371-378 (2017) - [e2]Erzsébet Csuhaj-Varjú, Pál Dömösi, György Vaszil:
Proceedings 15th International Conference on Automata and Formal Languages, AFL 2017, Debrecen, Hungary, September 4-6, 2017. EPTCS 252, 2017 [contents] - 2016
- [j26]Pál Dömösi, Szilárd Zsolt Fazekas, Masami Ito:
On Chomsky Hierarchy of Palindromic Languages. Acta Cybern. 22(3): 703-713 (2016) - 2015
- [j25]Pál Dömösi, Géza Horváth:
A Novel Cryptosystem Based on Gluskov Product of Automata. Acta Cybern. 22(2): 359-371 (2015) - 2014
- [c16]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: 119-136 - 2012
- [j24]
- 2011
- [j23]
- [e1]Pál Dömösi, Szabolcs Iván:
Automata and Formal Languages, 13th International Conference, AFL 2011, Debrecen, Hungary, August 17-22, 2011, Proceedings. 2011, ISBN 978-615-5097-19-5 [contents] - 2010
- [c15]Gemma Bel Enguix, Pál Dömösi, Alexander Krassovitskiy:
Parsing by Simple Insertion Systems. ICAART (2) 2010: 383-387
2000 – 2009
- 2009
- [j22]Pál Dömösi, Géza Horváth, Laurent Vuillon:
On the Shyr-Yu theorem. Theor. Comput. Sci. 410(47-49): 4874-4877 (2009) - [c14]Pál Dömösi:
Automata Networks without any Letichevsky Criteria. Automata, Formal Languages, and Related Topics 2009: 39-54 - 2008
- [j21]Pál Dömösi, Masami Ito, Solomon Marcus:
Marcus contextual languages consisting of primitive words. Discrete Mathematics 308(21): 4877-4881 (2008) - 2007
- [c13]
- 2006
- [j20]Pál Dömösi, Géza Horváth:
Alternative proof of the Lyndon-Schützenberger Theorem. Theor. Comput. Sci. 366(3): 194-198 (2006) - 2005
- [j19]Pál Dömösi, Géza Horváth:
The Language of Primitive Words in not Regular: Two Simple Proofs. Bulletin of the EATCS 87: 191-194 (2005) - [j18]Pál Dömösi, Manfred Kudlek:
New Iteration Lemmata for Regular Languages. Fundam. Inform. 64(1-4): 151-157 (2005) - 2004
- [c12]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: 60-67 - 2003
- [j17]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): 295-317 (2003) - [c11]Pál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura:
Some Remarks on Primitive Words and Palindromes. DCFS 2003: 245-254 - 2001
- [j16]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): 25-32 (2001) - [j15]Pál Dömösi, Zoltán Ésik:
Homomorphic Simulation and Letichevsky's Criterion. Journal of Automata, Languages and Combinatorics 6(4): 427-436 (2001) - [c10]Pál Dömösi:
On Complete Classes of Directed Graphs. Words, Semigroups, and Transductions 2001: 69-79 - [c9]Pál Dömösi, Masami Ito:
Multiple keyword patterns in context-free languages. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 237-241 - 2000
- [j14]
- [j13]Pál Dömösi, Chrystopher L. Nehaniv:
On complete systems of automata. Theor. Comput. Sci. 245(1): 27-54 (2000) - [c8]Pál Dömösi, Alexandru Mateescu:
On Slender Context-Free Languages. Recent Topics in Mathematical and Computational Linguistics 2000: 97-103 - [c7]Pál Dömösi, Masami Ito:
A Parsing Problem for Context-Sensitive Languages. Words, Languages & Combinatorics 2000: 183-184 - [c6]Pál Dömösi, Manfred Kudlek:
An Improvement of Iteration Lemmata for Context-free Languages. Words, Languages & Combinatorics 2000: 185-191
1990 – 1999
- 1999
- [j12]Pál Dömösi, Chrystopher L. Nehaniv:
Complete Finite Automata Network Graphs with Minimal Number of Edges. Acta Cybern. 14(1): 37-50 (1999) - [j11]Pál Dömösi, Satoshi Okawa, Sadaki Hirose:
A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear Languages. Bulletin of the EATCS 68: 151 (1999) - [c5]Pál Dömösi, Manfred Kudlek:
Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages. FCT 1999: 226-233 - 1996
- [c4]Pál Dömösi, Masami Ito, Masashi Katsura, Chrystopher L. Nehaniv:
A New Pumping Property of Context-Free Language. DMTCS 1996: 187-193 - 1993
- [c3]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: 194-203 - 1990
- [j10]Pál Dömösi, Zoltán Ésik:
Product hierarchies of automata and homomorphic simulation. Acta Cybern. 9(4): 371-373 (1990)
1980 – 1989
- 1989
- [c2]
- 1988
- [j9]
- [j8]Pál Dömösi, Zoltán Ésik:
On homomorphic simulation of automata by α0-products. Acta Cybern. 8(4): 315-323 (1988) - [j7]Pál Dömösi, Zoltán Ésik:
Critical Classes for the alpha_0-Product. Theor. Comput. Sci. 61: 17-24 (1988) - 1986
- [j6]Zoltán Ésik, Pál Dömösi:
Complete Classes of Automata for the alpha-0-Product. Theor. Comput. Sci. 47(3): 1-14 (1986) - [c1]Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh:
Homomorphic Realizations of Automata with Compositions. MFCS 1986: 299-307 - 1983
- [j5]
- [j4]
1970 – 1979
- 1976
- [j3]
- [j2]
- 1972
- [j1]Pál Dömösi:
On the semigroup of automaton mappings with finite alphabet. Acta Cybern. 1(4): 251-254 (1972)
Coauthor Index
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-03-07 10:38 CET by the dblp team