Sándor Horváth Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2002
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSándor Horváth, Peter Leupold, Gerhard Lischke: Roots and Powers of Regular Languages. Developments in Language Theory 2002: 220-230
2000
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Choffrut, Sándor Horváth: Transfinite Equations in Transfinite Strings. IJAC 10(5): 625-650 (2000)
1999
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSá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
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Choffrut, Sándor Horváth: Equations in Transfinite Strings. MFCS 1998: 656-664
1993
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPá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
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSándor Horváth: A Definition and a Generating System for Elementary Sequence Functions. Elektronische Informationsverarbeitung und Kybernetik 25(11/12): 603-606 (1989)
1987
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSándor Horváth, Juhani Karhumäki, Jetty Kleijn: Results Concerning Palindromicity. Elektronische Informationsverarbeitung und Kybernetik 23(8/9): 441-451 (1987)
1986
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSándor Horváth: Finite, simple generating systems for partial recursive functions. Bulletin of the EATCS 28: 30-31 (1986)
1985
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSándor Horváth: On Defining the Blum Complexity of Partial Recursive Sequence Functions. Elektronische Informationsverarbeitung und Kybernetik 21(4/5): 229-231 (1985)
1978
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuc Boasson, Sándor Horváth: On languages satisfying Ogden's lemma. ITA 12(3): (1978)
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSándor Horváth: The family of languages satisfying "Bar-Hillel's" lemma. ITA 12(3): (1978)
1977
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSándor Horváth: Complexity of Sequence Encoding. FCT 1977: 399-404
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSándor Horváth: Optimal RAS Programs for Arbitrarily Complex 0-1 Valued Functions. MFCS 1977: 297-302
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSándor Horváth: On the existence of k-separated finite and infinite dipaths. J. Comb. Theory, Ser. B 22(3): 284-285 (1977)
1976
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHajnal 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)

Coauthor Index

1Hajnal Andréka [1]
2Luc Boasson [6]
3Christian Choffrut [12] [14]
4Pál Dömösi [11]
5Masami Ito [11] [13]
6Juhani Karhumäki [9]
7László Kászonyi [11]
8Masashi Katsura [11]
9Jetty Kleijn (H. C. M. Kleijn) [9]
10Peter Leupold [15]
11Gerhard Lischke [15]
12István Németi [1]

Colors in the list of coauthors

Copyright © Thu Nov 26 17:33:31 2009 by Michael Ley (ley@uni-trier.de)