Sándor Horváth

According to our database, Sándor Horváth authored at least 18 papers between 1973 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Parameter Determination and Drive Control Analysis of Axial Flux Permanent Magnet Synchronous Motors.

Attila Nyitrai, Gergely Szabó, Sándor Horváth

Period. Polytech. Electr. Eng. Comput. Sci., 2022

2010

A Complete Density Range of Continuum-Many Non-Context-Free Languages Fulfilling Strong Iteration Properties.

Sándor Horváth, Manfred Kudlek

J. Autom. Lang. Comb., 2010

2003

Some Remarks on Primitive Words and Palindromes.

Pál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura

Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2002

Roots and Powers of Regular Languages.

Sándor Horváth, Peter Leupold, Gerhard Lischke

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2000

Transfinite Equations in Transfinite Strings.

Christian Choffrut, Sándor Horváth

Int. J. Algebra Comput., 2000

1999

Decidable and Undecidable Problems of Primitive Words, Regular and Context-Free Languages.

Sándor Horváth, Masami Ito

J. Univers. Comput. Sci., 1999

1998

Equations in Transfinite Strings.

Christian Choffrut, Sándor Horváth

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1993

Formal Languages Consisting of Primitive Words.

Pál Dömösi, Sándor Horváth, Masami Ito, László Kászonyi, Masashi Katsura

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1989

A Definition and a Generating System for Elementary Sequence Functions.

Sándor Horváth

J. Inf. Process. Cybern., 1989

1987

Results Concerning Palindromicity.

Sándor Horváth, Juhani Karhumäki, Jetty Kleijn

J. Inf. Process. Cybern., 1987

1986

Finite, simple generating systems for partial recursive functions.

Sándor Horváth

Bull. EATCS, 1986

1985

On Defining the Blum Complexity of Partial Recursive Sequence Functions.

Sándor Horváth

J. Inf. Process. Cybern., 1985

1978

The family of languages satisfying "Bar-Hillel's" lemma.

Sándor Horváth

RAIRO Theor. Informatics Appl., 1978

On languages satisfying Ogden's lemma.

Luc Boasson, Sándor Horváth

RAIRO Theor. Informatics Appl., 1978

1977

On the existence of k-separated finite and infinite dipaths.

Sándor Horváth

J. Comb. Theory B, 1977

Optimal RAS Programs for Arbitrarily Complex 0-1 Valued Functions.

Sándor Horváth

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

Complexity of Sequence Encoding.

Sándor Horváth

Proceedings of the Fundamentals of Computation Theory, 1977

1973

Notes on maximal congruence relations, automata and related topics.

Hajnal Andréka, Sándor Horváth, István Németi

Acta Cybern., 1973