Publications
Found 417 results
[ Author] Title Type Year Filters: First Letter Of Last Name is A [Clear All Filters]
Are 2 Electrocardiographic Leads Enough for Multilead Wave Boundary Location and QT Measuring? In: Murray A, editor. {36th Annual Computers in Cardiology Conference (CinC 2009)}. Vol {36}. {IEEE}; 2009. {. {p. 593-596p. }.Edit
On iterated semidirect products of finite semilattices. J. Algebra. 1991;142:239-254.Edit
Rational codes and free profinite monoids. J. Lond. Math. Soc. (2). 2009;79:465-477.Edit
Presentations of Schützenberger groups of minimal subshifts. Israel J. Math.. 2013;196:1-31.Edit
Residually finite congruences and quasi-regular subsets in uniform algebras. Portugal. Math.. 1989;46:313-328.Edit
An automata-theoretic approach to the word problem for ω-terms over $\ssfR$. Theoret. Comput. Sci.. 2007;370:131-169.Edit
Pseudovariety joins involving $\scr J$-trivial semigroups. Internat. J. Algebra Comput.. 1999;9:99-112.Edit
[2015-34] Representations of relatively free profinite semigroups, irreducibility, and order primitivity .Edit
[2009-39] New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy .Edit
Implicit operations on certain classes of semigroups. In: Semigroups and their applications (Chico, Calif., 1986). Reidel, Dordrecht; 1987. 1. p. 1-11p. Edit
José Morgado: in memoriam. Bol. Soc. Port. Mat.. 2004:1-18.Edit
Minimal nonpermutative pseudovarieties of semigroups. III. Algebra Universalis. 1985;21:256-279.Edit
The ω-inequality problem for concatenation hierarchies of star-free languages. Forum Mathematicum. 2018;30:663-679.Edit
Free profinite semigroups over semidirect products. Izv. Vyssh. Uchebn. Zaved. Mat.. 1995:3-31.Edit
On the hyperdecidability of semidirect products of pseudovarieties. Comm. Algebra. 1998;26:4065-4077.Edit
Sur certains systèmes d'équations avec contraintes dans un groupe libre–-addenda. Port. Math. (N.S.). 2001;58:379-387.Edit
On the power semigroup of a finite semigroup. Portugal. Math.. 1992;49:295-331.Edit
New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages. Discrete Math. Theor. Comput. Sci.. 2010;12:41-58.Edit
Decidability and tameness in the theory of finite semigroups. Bull. Iranian Math. Soc.. 2008;34:1-22.Edit
The pro-nilpotent group topology on a free group. Journal of Algebra. 2017;480:332-345.Edit
On the topological semigroup of equational classes of finite functions under composition. J. of Mult.-Valued Logic & Soft Computing. 2017;28(1):5-28.Edit
On the decidability of iterated semidirect products with applications to complexity. Proc. London Math. Soc. (3). 2000;80:50-74.Edit