| 2008 |
|---|
| 28 | EE | Pál Dömösi,
Masami Ito,
Solomon Marcus:
Marcus contextual languages consisting of primitive words.
Discrete Mathematics 308(21): 4877-4881 (2008) |
| 2006 |
|---|
| 27 | EE | 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 |
|---|
| 26 | | 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) |
| 25 | EE | Pál Dömösi,
Manfred Kudlek:
New Iteration Lemmata for Regular Languages.
Fundam. Inform. 64(1-4): 151-157 (2005) |
| 2004 |
|---|
| 24 | EE | 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 |
|---|
| 23 | EE | 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) |
| 2001 |
|---|
| 22 | | Pál Dömösi:
On Complete Classes of Directed Graphs.
Words, Semigroups, and Transductions 2001: 69-79 |
| 21 | EE | 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) |
| 20 | | 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) |
| 2000 |
|---|
| 19 | | Pál Dömösi,
Alexandru Mateescu:
On Slender Context-Free Languages.
Recent Topics in Mathematical and Computational Linguistics 2000: 97-103 |
| 18 | EE | Pál Dömösi:
Unusual Algorithms for Lexicographical Enumeration.
Acta Cybern. 14(3): 461-468 (2000) |
| 17 | EE | Pál Dömösi,
Chrystopher L. Nehaniv:
On complete systems of automata.
Theor. Comput. Sci. 245(1): 27-54 (2000) |
| 1999 |
|---|
| 16 | EE | Pál Dömösi,
Manfred Kudlek:
Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages.
FCT 1999: 226-233 |
| 15 | EE | 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) |
| 14 | | 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) |
| 1993 |
|---|
| 13 | | 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 |
|---|
| 12 | | Pál Dömösi,
Zoltán Ésik:
Product hierarchies of automata and homomorphic simulation.
Acta Cybern. 9(4): 371-373 (1990) |
| 1989 |
|---|
| 11 | | Pál Dömösi,
Zoltán Ésik,
Balázs Imreh:
On Product Hierarchies of Automata.
FCT 1989: 137-144 |
| 1988 |
|---|
| 10 | | Pál Dömösi,
Zoltán Ésik:
On the hiearchy of nui-product.
Acta Cybern. 8: 253-257 (1988) |
| 9 | | Pál Dömösi,
Zoltán Ésik:
On homomorphic simulation of automata by alphai-producst.
Acta Cybern. 8: 315-323 (1988) |
| 8 | | Pál Dömösi,
Zoltán Ésik:
Critical Classes for the alpha_0-Product.
Theor. Comput. Sci. 61: 17-24 (1988) |
| 1986 |
|---|
| 7 | | Zoltán Ésik,
Pál Dömösi,
Ferenc Gécseg,
J. Virágh:
Homomorphic Realizations of Automata with Compositions.
MFCS 1986: 299-307 |
| 6 | | 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) |
| 1983 |
|---|
| 5 | | Pál Dömösi,
Balázs Imreh:
On nui-products of automata.
Acta Cybern. 6: 149-162 (1983) |
| 4 | | Pál Dömösi:
On homomorphically alphai-complete systems of automata.
Acta Cybern. 6: 85-88 (1983) |
| 1977 |
|---|
| 3 | | Pál Dömösi:
On minimal R-complete systems of finite automata.
Acta Cybern. 3: 37-41 (1977) |
| 1976 |
|---|
| 2 | | Pál Dömösi:
On superpositions of automata.
Acta Cybern. 2: 335-343 (1976) |
| 1972 |
|---|
| 1 | | Pál Dömösi:
On the semigroup of automaton mappings with finite alphabet.
Acta Cybern. 1: 251-254 (1972) |
