Sándor Horváth

Publication Activity (10 Years)

Years Active: 1973-2022
Publications (10 Years): 1

Top Topics

Parameter Determination

Top Venues

Period. Polytech. Electr. Eng. Comput. Sci.

Publications

Attila Nyitrai, Gergely Szabó, Sándor Horváth
Parameter Determination and Drive Control Analysis of Axial Flux Permanent Magnet Synchronous Motors. Period. Polytech. Electr. Eng. Comput. Sci. 66 (2) (2022)
Sándor Horváth, Manfred Kudlek
A Complete Density Range of Continuum-Many Non-Context-Free Languages Fulfilling Strong Iteration Properties. J. Autom. Lang. Comb. 15 (3/4) (2010)
Pál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura
Some Remarks on Primitive Words and Palindromes. DCFS (2003)
Sándor Horváth, Peter Leupold, Gerhard Lischke
Roots and Powers of Regular Languages. Developments in Language Theory (2002)
Christian Choffrut, Sándor Horváth
Transfinite Equations in Transfinite Strings. Int. J. Algebra Comput. 10 (5) (2000)
Sándor Horváth, Masami Ito
Decidable and Undecidable Problems of Primitive Words, Regular and Context-Free Languages. J. Univers. Comput. Sci. 5 (9) (1999)
Christian Choffrut, Sándor Horváth
Equations in Transfinite Strings. MFCS (1998)
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)
Sándor Horváth
A Definition and a Generating System for Elementary Sequence Functions. J. Inf. Process. Cybern. 25 (11/12) (1989)
Sándor Horváth, Juhani Karhumäki, Jetty Kleijn
Results Concerning Palindromicity. J. Inf. Process. Cybern. 23 (8/9) (1987)
Sándor Horváth
Finite, simple generating systems for partial recursive functions. Bull. EATCS 28 (1986)
Sándor Horváth
On Defining the Blum Complexity of Partial Recursive Sequence Functions. J. Inf. Process. Cybern. 21 (4/5) (1985)
Sándor Horváth
The family of languages satisfying "Bar-Hillel's" lemma. RAIRO Theor. Informatics Appl. 12 (3) (1978)
Luc Boasson, Sándor Horváth
On languages satisfying Ogden's lemma. RAIRO Theor. Informatics Appl. 12 (3) (1978)
Sándor Horváth
On the existence of k-separated finite and infinite dipaths. J. Comb. Theory, Ser. B 22 (3) (1977)
Sándor Horváth
Optimal RAS Programs for Arbitrarily Complex 0-1 Valued Functions. MFCS (1977)
Sándor Horváth
Complexity of Sequence Encoding. FCT (1977)
Hajnal Andréka, Sándor Horváth, István Németi
Notes on maximal congruence relations, automata and related topics. Acta Cybern. 2 (1) (1973)