Sándor Horváth

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