Sándor Horváth

According to our database1, Sándor Horváth authored at least 17 papers between 1973 and 2010.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2010
A Complete Density Range of Continuum-Many Non-Context-Free Languages Fulfilling Strong Iteration Properties.
Journal of Automata, Languages and Combinatorics, 2010

2003
Some Remarks on Primitive Words and Palindromes.
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.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2000
Transfinite Equations in Transfinite Strings.
IJAC, 2000

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

1998
Equations in Transfinite Strings.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1993
Formal Languages Consisting of Primitive Words.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1989
A Definition and a Generating System for Elementary Sequence Functions.
Elektronische Informationsverarbeitung und Kybernetik, 1989

1987
Results Concerning Palindromicity.
Elektronische Informationsverarbeitung und Kybernetik, 1987

1986
Finite, simple generating systems for partial recursive functions.
Bulletin of the EATCS, 1986

1985
On Defining the Blum Complexity of Partial Recursive Sequence Functions.
Elektronische Informationsverarbeitung und Kybernetik, 1985

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

On languages satisfying Ogden's lemma.
ITA, 1978

1977
On the existence of k-separated finite and infinite dipaths.
J. Comb. Theory, Ser. B, 1977

Optimal RAS Programs for Arbitrarily Complex 0-1 Valued Functions.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

Complexity of Sequence Encoding.
FCT, 1977

1973
Notes on maximal congruence relations, automata and related topics.
Acta Cybern., 1973


  Loading...