Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Ferenc Gécseg"'
Autor:
Ferenc Gécseg
Publikováno v:
Acta Cybernetica. 20:253-267
Autor:
Ferenc Gécseg
Publikováno v:
International Journal of Foundations of Computer Science. 18:1237-1246
In this paper finite state recognizers are considered as unary tree recognizers with unary operational symbols. We introduce translation recognizers of a tree recognizer, which are finite state recognizers whose operations are the elementary translat
Autor:
Ferenc Gecseg
Both theoretical and practical considerations motivate the repre sentation of objects as certain compositions of simpler ones. In the theory of automata this observation has led to the concepts of pro ducts and complete systems of automata. In th
Autor:
Helmut Jürgensen, Ferenc Gécseg
Publikováno v:
Fundamenta Informaticae. 25:247-256
The notions of independence and dimension as introduced by Cohn for universal algebras are quite significantly different from the standard ones. This paper compares some of these notions. In particular, necessary and sufficient conditions for spannin
Autor:
Balázs Imreh, Ferenc Gécseg
Publikováno v:
Acta Mathematica Hungarica. 68:151-159
Autor:
Helmut Jürgensen, Ferenc Gécseg
Publikováno v:
Algebra Universalis. 30:422-446
We study the notions of independence and dimension as introduced in [2]. These are significantly different from the standard notions as reviewed in [4]. However, from quite a few points of view they deserve careful analysis. Our work was motivated by
Publikováno v:
Lecture Notes in Computer Science ISBN: 3540167838
MFCS
MFCS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fae899f2013fbd81de8269e35729ec12
https://doi.org/10.1007/bfb0016254
https://doi.org/10.1007/bfb0016254
Autor:
Ferenc Gécseg
Publikováno v:
Developments in Language Theory ISBN: 9783540404347
Developments in Language Theory
Developments in Language Theory
Products of tree automata do not preserve the basic properties of homomorphically and metrically complete systems of finite state automata. To remedy it, we have introduced the concept of the quasi-product of tree automata which is only a slightly mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e3c87f4607031e772dbde534a914b11
https://doi.org/10.1007/3-540-45007-6_3
https://doi.org/10.1007/3-540-45007-6_3
Autor:
Balázs Imreh, Ferenc Gécseg
Publikováno v:
Words, Semigroups, and Transductions: Festschrift in Honor of Gabriel Thierrin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f2d84e23197587b6d52c36b4ac5596c
https://doi.org/10.1142/9789812810908_0011
https://doi.org/10.1142/9789812810908_0011