Jorge Almeida

Orcid: 0000-0002-3829-2382

Affiliations:
  • University of Porto, Faculdade de Ciências, CMUP, Porto, Portugal


According to our database1, Jorge Almeida authored at least 44 papers between 1988 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Book Introduction by the Authors: Profinite Semigroups and Symbolic Dynamic.
Bull. EATCS, 2022

2021
Binary patterns in the Prouhet-Thue-Morse sequence.
Discret. Math. Theor. Comput. Sci., 2021

Profinite topologies.
Proceedings of the Handbook of Automata Theory., 2021

2020
Profinite congruences and unary algebras.
CoRR, 2020

2019
On the insertion of n-powers.
Discret. Math. Theor. Comput. Sci., 2019

Recognizing pro-R closures of regular languages.
CoRR, 2019

2017
On the Topological Semigroup of Equational Classes of Finite Functions Under Composition.
J. Multiple Valued Log. Soft Comput., 2017

Complete κ-reducibility of pseudovarieties of the form DRH.
Int. J. Algebra Comput., 2017

The linear nature of pseudowords.
CoRR, 2017

Commutative Positive Varieties of Languages.
Acta Cybern., 2017

2016
Semisimple Synchronizing Automata and the Wedderburn-Artin Theory.
Int. J. Found. Comput. Sci., 2016

Reducibility vs. definability for pseudovarieties of semigroups.
Int. J. Algebra Comput., 2016

Factoriality and the Pin-Reutenauer procedure.
Discret. Math. Theor. Comput. Sci., 2016

The omega-inequality problem for concatenation hierarchies of star-free languages.
CoRR, 2016

2015
McCammond's normal forms for free aperiodic semigroups revisited.
LMS J. Comput. Math., 2015

On fixed points of the lower set operator.
Int. J. Algebra Comput., 2015

On Decidability of Intermediate Levels of Concatenation Hierarchies.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014
Iterated periodicity over finite aperiodic semigroups.
Eur. J. Comb., 2014

2013
On the Semigroup of Equational Classes of Finite Functions.
Proceedings of the 43rd IEEE International Symposium on Multiple-Valued Logic, 2013

2012
On the Transition Semigroups of Centrally Labeled Rauzy Graphs.
Int. J. Algebra Comput., 2012

2010
New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages.
Discret. Math. Theor. Comput. Sci., 2010

2009
A counterexample to a conjecture concerning concatenation hierarchies.
Inf. Process. Lett., 2009

Matrix Mortality and the Cerný-Pin Conjecture.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008
Description and analysis of a bottom-up DFA minimization algorithm.
Inf. Process. Lett., 2008

2007
An automata-theoretic approach to the word problem for omega -terms over R.
Theor. Comput. Sci., 2007

2006
Subword Complexity of Profinite Words and Subgroups of Free Profinite Semigroups.
Int. J. Algebra Comput., 2006

2005
The pseudovariety of semigroups of triangular matrices over a finite field.
RAIRO Theor. Informatics Appl., 2005

The globals of pseudovarieties of ordered semigroups containing B2 and an application to a problem proposed by Pin.
RAIRO Theor. Informatics Appl., 2005

Tameness of the Pseudovariety of Abelian Groups.
Int. J. Algebra Comput., 2005

2004
The Globals of Some Subpseudovarieties of DA.
Int. J. Algebra Comput., 2004

2001
SC-hyperdecidability of R.
Theor. Comput. Sci., 2001

The Gap Between Partial and Full: an Addendum.
Int. J. Algebra Comput., 2001

2000
On Hyperdecidable Pseudovarieties of Simple Semigroups.
Int. J. Algebra Comput., 2000

Semidirect Products With the Pseudovariety of All Finite Groups.
Proceedings of the International Colloquium on Words, 2000

1999
Pseudovariety Joins involving -Trivial Semigroups.
Int. J. Algebra Comput., 1999

Hyperdecidable Pseudovarieties and the Calculation of Semidirect Products.
Int. J. Algebra Comput., 1999

1998
The Gap Between Partial and Full.
Int. J. Algebra Comput., 1998

1997
The Pseudovariety J is Hyperdecidable.
RAIRO Theor. Informatics Appl., 1997

Free Profinite ℛ-Trivial Monoids.
Int. J. Algebra Comput., 1997

1996
A Syntactical Proof of Locality of da.
Int. J. Algebra Comput., 1996

1994
Reduced Factorizations in Free Profinite Groups and Join Decompositions of Pseudovarieties.
Int. J. Algebra Comput., 1994

1993
Locally Commutative Power Semigroups and Counting Factors of Words.
Theor. Comput. Sci., 1993

1991
On Direct Product Decompositions of Finite -Trivial Semigroups.
Int. J. Algebra Comput., 1991

1988
Equations for pseudovarieties.
Proceedings of the Formal Properties of Finite Automata and Applications, 1988


  Loading...