You are here

Horváth Géza

Horváth Géza

Horváth Géza
DE
associate professor
Name: Horváth Géza
Other profiles: MTMT
Degree
  • PhD, Debreceni Egyetem (2003)
  • Dr. habil., Debreceni Egyetem (2017)
Profession: Formal Languages, Automata Networks, Cryptography
Source: NEPTUN system

Publication list

Uploaded publications:
25
Publications in DEA:
25
OA:
7
Date range:
1999-2017
2017
  1. Dömösi, P., Horváth, G.: A Novel stream cipher based on deterministic finite automaton.
    In: Ninth Workshop on Non-Classical Models of Automata and Applications (NCMA 2017) : Short Papers, [Faculty of Mathematics and Physics Charles University], [Prague], 11-16, 2017.
  2. Aradi, B., Bujdosó, G., Horváth, G., Szokol, P.: Informatika a felsőoktatásban 2017 konferencia kiadványa.
    Debreceni Egyetem Informatikai Kar, Debrecen, 475 p., 2017. ISBN: 9789634732136
  3. Dömösi, P., Gáll, J., Horváth, G., Tihanyi, N.: Statistical analysis of DH1 cryptosystem.
    Acta Cybern. 23 (1), 371-378, 2017.
    Journal metrics:
    Q4 Computational Theory and Mathematics
    Q3 Computer Science (miscellaneous)
    Q4 Computer Vision and Pattern Recognition
    Q3 Electrical and Electronic Engineering
    Q4 Information Systems and Management
    Q4 Management Science and Operations Research
    Q4 Software
    Q4 Theoretical Computer Science
2016
  1. Dömösi, P., Gáll, J., Horváth, G., Tihanyi, N.: On NIST test of a novel cryptosystem based on automata compositions.
    In: Middle-European Conference on Applied Theoretical Computer Science (MATCOS 2016) [elektronikus dokumentum] : zbornik 19. mednarodne multikonference Informacijska družba - IS 2016, 12.-13. oktober 2016, [Ljubljana, Slovenija] = proceedings of the 19th International Multiconference Information Society - IS 2016, 12.-13 October 2016, Ljubljana, Slovenia : zvezek H = volume H. Ed.: Andrej Brodnik, Institut Jožef Stefan, Ljubljana, 24-27, 2016. ISBN: 9789612641047
2015
  1. Dömösi, P., Horváth, G.: A novel cryptosystem based on abstract automata and Latin cubes.
    Stud. Sci. Math. Hung. 52 (2), 221-232, 2015.
    Journal metrics:
    Q3 Mathematics (miscellaneous)
  2. Dömösi, P., Horváth, G.: A novel cryptosystem based on Gluškov product of automata.
    Acta Cybern. 22 (2), 359-371, 2015.
    Journal metrics:
    Q4 Computational Theory and Mathematics
    Q3 Computer Science (miscellaneous)
    Q4 Computer Vision and Pattern Recognition
    Q3 Electrical and Electronic Engineering
    Q4 Information Systems and Management
    Q4 Management Science and Operations Research
    Q4 Software
    Q4 Theoretical Computer Science
2014
  1. Dömösi, P., Horváth, G.: Automataelméleti alapú titkosítási rendszerek.
    In: Informatika a Felsőoktatásban 2014 [elektronikus dokumentum]. Szerk.: Kunkli Roland, Papp Ildikó, Rutkovszky Edéné, DE Informatikai Kar, Debrecen, 433-442, 2014. ISBN: 9789634737124
  2. Horváth, G., Nagy, B.: Formal Languages and Automata Theory [Elektronikus dokumentum].
    Typotex, Budapest, 137 p., 2014. ISBN: 9789632793443
2011
  1. Dömösi, P., Falucskai, J., Horváth, G., Mecsei, Z., Nagy, B.: Formális nyelvek és automaták.
    Lektorált Internetes Kiadvány, Debrecen, 239 p., 2011.
2010
2009
  1. Dömösi, P., Horváth, G., Vuillon, L.: On the Shyr-Yu theorem.
    Theor. Comput. Sci. 410 (47-49), 4874-4877, 2009.
    Journal metrics:
    Q1 Computer Science (miscellaneous)
    Q2 Theoretical Computer Science
2006
  1. Dömösi, P., Horváth, G.: Alternative Proof of the Lyndod-Schützenberger Theorem.
    Theor. Comput. Sci. 366 (3), 194-198, 2006.
    Journal metrics:
    Q1 Computer Science (miscellaneous)
    Q2 Theoretical Computer Science
  2. Horváth, G., Shoji, K.: New Pumping Lemma for Non-Linear Context-Free Languages.
    In: Algorithmic problems in Algebras, Languages and Computation. Ed.: Kunitaka Shoji, R.I.M.S. Kyoto University, Kyoto, 160-163, 2006.
  3. Dömösi, P., Horváth, G., Ito, M., Shikishima-Tsuji, K.: Some Periodicity of Words and Marcus Contextual Grammars.
    Vietnam J. of Math. 34 (4), 381-387, 2006.
2005
  1. Dömösi, P., Horváth, G.: On Products of Primitive Words.
    In: Automata and Formal Languages. Ed.: Ésik Zoltán, Fülöp Zoltán, Novadat, Szeged, 112-121, 2005.
2004
  1. Horváth, G.: A phi faktorizáló algoritmus.
    Alkalm. mat. l. 21 (2), 253-262, 2004.
  2. Dömösi, P., Horváth, G., Ito, M.: A Small Hierarchy of Languages Consisting of Non-Primitive Words.
    Publ. Math., Debrecen. 64 (3-4), 261-267, 2004.
    Journal metrics:
    Q2 Mathematics (miscellaneous)
  3. Horváth, G., Ito, M.: Small Grammars and Primitive Words.
    In: Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory. Ed.: Masami Ito, R.I.M.S. Kyoto University, Kyoto, 62-72, 2004.
2003
  1. Dömösi, P., Fazekas, A., Horváth, G., Mecsei, Z.: Formális nyelvek és automaták: egyetemi jegyzet.
    Lektorált Internetes Kiadvány, Debrecen, 101 p., 2003.
  2. Horváth, G., Mecsei, Z., Nagy, B.: Formális nyelvek és automaták: gyakorlati összefoglaló.
    Lektorált Internetes Kiadvány, Debrecen, 89 p., 2003.
  3. Demény, M., Horváth, G., Nagylaki, Z., Nagylaki, C.: Visualization of Cellular Automata.
    In: Words, Languages and Combinatorics III. Ed.: Masami Ito, Teruo Imaoka, Word Scientific, River Edge, N. J., 162-170, 2003.
2001
  1. Horváth, G., Inoue, K., Ito, A., Wang, Y.: Closure Property of Probabilistic Turing Machines and Alternating Turing Machines with Subalgorithmic Spaces.
    Int. J. Found. Comput. Sci. 12 (3), 397-409, 2001.
    Journal metrics:
    Q3 Computer Science (miscellaneous)
1999
  1. Nagylaki, Z., Horváth, G., Ito, M.: PDL robots represented in VRML environment.
    In: Languages, Algebra and Computer Systems : [Kyōto, March 3 - 10, 1999] / Masami Ito, R.I.M.S. Kyoto University, Kyoto, 174-185, 1999.
  2. Dömösi, P., Hauschildt, D., Horváth, G., Kudlek, M.: Some Results on Small Context-free Grammars Generating Primitive Words.
    Publ. Math., Debrecen. 54 667-686, 1999.
    Journal metrics:
    Q3 Mathematics (miscellaneous)
updated: 2020-10-18, 01:21

SCImago quartiles of
scientific journal articles

Number of scientific articles: 12
Q1 2 (16.7%)
Q2 1 (8.3%)
Q3 5 (41.7%)
N/A 4 (33.3%)

SCImago subject areas and categories

Mathematics (7)
Theoretical Computer Science (4)
Mathematics (miscellaneous) (3)
Computer Science (5)
Computer Science (miscellaneous) (5)
Computational Theory and Mathematics (2)
Computer Vision and Pattern Recognition (2)
Software (2)
Decision Sciences (2)
Information Systems and Management (2)
Management Science and Operations Research (2)
Engineering (2)
Electrical and Electronic Engineering (2)

Genre chart

Year chart

Language chart