2002 |
15 | EE | Sándor Horváth,
Peter Leupold,
Gerhard Lischke:
Roots and Powers of Regular Languages.
Developments in Language Theory 2002: 220-230 |
2000 |
14 | EE | Christian Choffrut,
Sándor Horváth:
Transfinite Equations in Transfinite Strings.
IJAC 10(5): 625-650 (2000) |
1999 |
13 | EE | Sándor Horváth,
Masami Ito:
Decidable and Undecidable Problems of Primitive Words, Regular and Context-Free Languages.
J. UCS 5(9): 532-541 (1999) |
1998 |
12 | EE | Christian Choffrut,
Sándor Horváth:
Equations in Transfinite Strings.
MFCS 1998: 656-664 |
1993 |
11 | | 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 |
1989 |
10 | | Sándor Horváth:
A Definition and a Generating System for Elementary Sequence Functions.
Elektronische Informationsverarbeitung und Kybernetik 25(11/12): 603-606 (1989) |
1987 |
9 | | Sándor Horváth,
Juhani Karhumäki,
Jetty Kleijn:
Results Concerning Palindromicity.
Elektronische Informationsverarbeitung und Kybernetik 23(8/9): 441-451 (1987) |
1986 |
8 | | Sándor Horváth:
Finite, simple generating systems for partial recursive functions.
Bulletin of the EATCS 28: 30-31 (1986) |
1985 |
7 | | Sándor Horváth:
On Defining the Blum Complexity of Partial Recursive Sequence Functions.
Elektronische Informationsverarbeitung und Kybernetik 21(4/5): 229-231 (1985) |
1978 |
6 | | Luc Boasson,
Sándor Horváth:
On languages satisfying Ogden's lemma.
ITA 12(3): (1978) |
5 | | Sándor Horváth:
The family of languages satisfying "Bar-Hillel's" lemma.
ITA 12(3): (1978) |
1977 |
4 | | Sándor Horváth:
Complexity of Sequence Encoding.
FCT 1977: 399-404 |
3 | | Sándor Horváth:
Optimal RAS Programs for Arbitrarily Complex 0-1 Valued Functions.
MFCS 1977: 297-302 |
2 | EE | Sándor Horváth:
On the existence of k-separated finite and infinite dipaths.
J. Comb. Theory, Ser. B 22(3): 284-285 (1977) |
1976 |
1 | | Hajnal Andréka,
Sándor Horváth,
István Németi:
Notes on maximal congruence relations, automata and related topics.
Acta Cybern. 2: 71-88 (1976) |