default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSándor Horváth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]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): 205-214 (2022)
2010 – 2019
- 2010
- [j11]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): 263-268 (2010)
2000 – 2009
- 2003
- [c6]Pál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura:
Some Remarks on Primitive Words and Palindromes. DCFS 2003: 245-254 - 2002
- [c5]Sándor Horváth, Peter Leupold, Gerhard Lischke:
Roots and Powers of Regular Languages. Developments in Language Theory 2002: 220-230 - 2000
- [j10]Christian Choffrut, Sándor Horváth:
Transfinite Equations in Transfinite Strings. Int. J. Algebra Comput. 10(5): 625-650 (2000)
1990 – 1999
- 1999
- [j9]Sándor Horváth, Masami Ito:
Decidable and Undecidable Problems of Primitive Words, Regular and Context-Free Languages. J. Univers. Comput. Sci. 5(9): 532-541 (1999) - 1998
- [c4]Christian Choffrut, Sándor Horváth:
Equations in Transfinite Strings. MFCS 1998: 656-664 - 1993
- [c3]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: 194-203
1980 – 1989
- 1989
- [j8]Sándor Horváth:
A Definition and a Generating System for Elementary Sequence Functions. J. Inf. Process. Cybern. 25(11/12): 603-606 (1989) - 1987
- [j7]Sándor Horváth, Juhani Karhumäki, Jetty Kleijn:
Results Concerning Palindromicity. J. Inf. Process. Cybern. 23(8/9): 441-451 (1987) - 1986
- [j6]Sándor Horváth:
Finite, simple generating systems for partial recursive functions. Bull. EATCS 28: 30-31 (1986) - 1985
- [j5]Sándor Horváth:
On Defining the Blum Complexity of Partial Recursive Sequence Functions. J. Inf. Process. Cybern. 21(4/5): 229-231 (1985)
1970 – 1979
- 1978
- [j4]Sándor Horváth:
The family of languages satisfying "Bar-Hillel's" lemma. RAIRO Theor. Informatics Appl. 12(3): 193-199 (1978) - [j3]Luc Boasson, Sándor Horváth:
On languages satisfying Ogden's lemma. RAIRO Theor. Informatics Appl. 12(3): 201-202 (1978) - 1977
- [j2]Sándor Horváth:
On the existence of k-separated finite and infinite dipaths. J. Comb. Theory B 22(3): 284-285 (1977) - [c2]Sándor Horváth:
Complexity of Sequence Encoding. FCT 1977: 399-404 - [c1]Sándor Horváth:
Optimal RAS Programs for Arbitrarily Complex 0-1 Valued Functions. MFCS 1977: 297-302 - 1973
- [j1]Hajnal Andréka, Sándor Horváth, István Németi:
Notes on maximal congruence relations, automata and related topics. Acta Cybern. 2(1): 71-88 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
