Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Magnus Steinby"'
Autor:
Magnus Steinby
Publikováno v:
Acta Cybernetica. 23(1):159-174
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::10ee9934d5cb8f02a2c2270b2e907563
http://juuli.fi/Record/0281759917
http://juuli.fi/Record/0281759917
Publikováno v:
Discussiones Mathematicae: General Algebra and Applications. 36:179-208
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5f8dfeaf89190e5cfc32a42fa0f74d4
http://juuli.fi/Record/0276974416
http://juuli.fi/Record/0276974416
Autor:
Antonio Cano Gómez, Magnus Steinby
Publikováno v:
Asian-European Journal of Mathematics. :49-79
A new type of syntactic monoid and semigroup of tree languages is introduced. For each n ≥ 1, we define for any tree language T its n-ary syntactic monoid Mn(T) and its n-ary syntactic semigroup Sn(T) as quotients of the monoid or semigroup, respec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0bbf18384476b443e2506dd56b5da3c
https://doi.org/10.1142/s179355711100006x
https://doi.org/10.1142/s179355711100006x
Autor:
Magnus Steinby, Gabriela Martin
Publikováno v:
Fundamenta Informaticae. 112:281-303
We study approximations of regular languages bymembers of a given variety L of regular languages. These are upper or lower approximations in the sense of Pawlak's rough set theory with respect to congruences belonging to the variety of congruences co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::453c273b1b25663d3d6a2b3305b5ff97
https://doi.org/10.3233/fi-2011-591
https://doi.org/10.3233/fi-2011-591
Autor:
Ctlin Ionu Tîrnuc, Magnus Steinby
Publikováno v:
Theoretical Computer Science. 410:3495-3503
We introduce a class of tree bimorphisms that define exactly the translations performed by syntax-directed translation schemata. We also show that these “quasi-alphabetic” tree bimorphisms preserve recognizability, and that their class is closed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ebc772cd9a929453ba92d004e1bac52d
https://doi.org/10.1016/j.tcs.2009.03.009
https://doi.org/10.1016/j.tcs.2009.03.009
Autor:
Magnus Steinby, Saeed Salehi
Publikováno v:
Theoretical Computer Science. 377(1-3):1-24
We consider several aspects of Wilke’s [T. Wilke, An algebraic characterization of frontier testable tree languages, Theoret. Comput. Sci. 154 (1996) 85–106] tree algebra formalism for representing binary labelled trees and compare it with approa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ded82b78fea450d4420fb73a999a3914
Publikováno v:
Scopus-Elsevier
Subdirect decompositions of unary algebras are studied in connection with one-element subalgebras, cores, Rees extensions of congruences of subalgebras, dense extensions and disjunctive elements. In particular, subdirectly irreducible unary algebras
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4620931a67239ec01fb7acc9600e4fae
https://doi.org/10.3233/fi-1999-381205
https://doi.org/10.3233/fi-1999-381205
Autor:
Magnus Steinby
Publikováno v:
Theoretical Computer Science. 205:1-43
We consider varieties of tree languages which are not restricted to a fixed ranked alphabet, varieties of finite algebras that contain algebras of all finite types, and a matching notion of varieties of congruences. A variety theorem that yields isom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad9228c7f6ac022cedfdb125c49a3b0c
https://doi.org/10.1016/s0304-3975(98)00010-3
https://doi.org/10.1016/s0304-3975(98)00010-3
Autor:
Magnus Steinby
Publikováno v:
Fundamenta Informaticae. 18:249-266
In this paper recognizable and rational subsets of general algebras of finite type are studied. These are natural generalizations of the familiar notions originally defined for monoids, but they also include as special cases recognizable and rational
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ed0694755d550c7ae3b9d3c7b0bf787
https://doi.org/10.3233/fi-1993-182-412
https://doi.org/10.3233/fi-1993-182-412
Autor:
Cătălin Ionuţ Tîrnăucă, Magnus Steinby
Publikováno v:
Implementation and Application of Automata ISBN: 9783540763352
CIAA
CIAA
We introduce a class of tree bimorphisms that define exactly the translations performed by syntax-directed translation schemata. We also show that these "quasi-alphabetic" tree bimorphisms preserve recognizability, and that their class is closed unde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27a1afa2fa649c92a9a7fb32827be3a7
https://doi.org/10.1007/978-3-540-76336-9_25
https://doi.org/10.1007/978-3-540-76336-9_25
