Publications

Found 25 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Title is S and Author is Jorge Almeida  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
S
Almeida J, Silva PV. SC-hyperdecidability of $\bf R$. Theoret. Comput. Sci.. 2001;255:569-591.Edit
[2009-28] Almeida J, Costa JC, Teixeira M.. Semidirect product with an order-computable pseudovariety and tameness .Edit
Almeida J, Costa JC, Teixeira M.. Semidirect product with an order-computable pseudovariety and tameness. Semigroup Forum. 2010;81:26-50.Edit
Almeida J. Semidirect products of pseudovarieties from the universal algebraist's point of view. J. Pure Appl. Algebra. 1989;60:113-128.Edit
Almeida J, Escada AP. Semidirect products with the pseudovariety of all finite groups. In: Words, languages & combinatorics, III (Kyoto, 2000). World Sci. Publ., River Edge, NJ; 2003. 1. p. 1-21p. Edit
Almeida J. Semidirectly closed pseudovarieties of locally trivial semigroups. Semigroup Forum. 1990;40:315-323.Edit
Almeida J, Pin J., Weil P. Semigroups whose idempotents form a subsemigroup. Math. Proc. Cambridge Philos. Soc.. 1992;111:241-253.Edit
Almeida J. Semigrupos finitos e álgebra universal Universidade de São Paulo, Instituto de Matemática e Estatí stica, São Paulo 1991.Edit
Almeida J, Rodaro E. Semisimple Synchronizing Automata and the Wedderburn-Artin Theory. In: Development in Language Theory, DLT 2014. Vol LNCS, 8633.; 2014. 4. p. 49-60p. Edit
Almeida J, Rodaro E. Semisimple synchronizing automata and the Wedderburn-Artin theory. In: Developments in Language Theory, 2014. Vol Developments in Language Theory. Russia, Ekaterinburg: Springer; 2014. 4. p. 49-60p. Edit
Almeida J, Rodaro E. Semisimple synchronizing automata and the Wedderburn-Artin theory. Internat. J. Foundat. Comput. Sci.. 2016;27(2):127-145.Edit
[2012-26] Almeida J, Cardoso Â. A Sequence of Weakly Monotonic Automata with Increasing Level .Edit
Almeida J, Cardoso Â. A sequence of weakly monotonic automata with increasing level. Int. J. Algebra. 2013;7:91-100.Edit
Almeida J. Some algorithmic problems for pseudovarieties. Publ. Math. Debrecen. 1999;54:531-552.Edit
Almeida J. Some algorithms on the star operation applied to finite languages. Semigroup Forum. 1984;28:187-197.Edit
Almeida J. Some key problems on finite semigroups. Semigroup Forum. 2002;64:159-179.Edit
Almeida J. Some order properties of the lattice of varieties of commutative semigroups. Canad. J. Math.. 1986;38:19-47.Edit
Almeida J. Some pseudovariety joins involving the pseudovariety of finite groups. Semigroup Forum. 1988;37:53-57.Edit
Almeida J. Some quasi-ordered classes of finite commutative semigroups. Semigroup Forum. 1985;32:189-200.Edit
[2009-14] Almeida J, Costa JC, Zeitoun M. Some structural properties of the free profinite aperiodic semigroup .Edit
Almeida J, Volkov M. Subword complexity of profinite words and subgroups of free profinite semigroups. Internat. J. Algebra Comput.. 2006;16:221-258.Edit
Almeida J, Delgado M.. Sur certains systèmes d'équations avec contraintes dans un groupe libre–-addenda. Port. Math. (N.S.). 2001;58:379-387.Edit
Almeida J, Delgado M.. Sur certains systèmes d'équations avec contraintes dans un groupe libre. Portugal. Math.. 1999;56:409-417.Edit
Almeida J, Steinberg B. Syntactic and global semigroup theory: a synthesis approach. In: Algorithmic problems in groups and semigroups (Lincoln, NE, 1998). Birkhäuser Boston, Boston, MA; 2000. 1. p. 1-23p. (Trends Math.).Edit
Almeida J. A syntactical proof of locality of DA. Internat. J. Algebra Comput.. 1996;6:165-177.Edit
Error | CMUP

Error

The website encountered an unexpected error. Please try again later.