Pedro V. Silva

Orcid: 0000-0003-1819-7289

According to our database1, Pedro V. Silva authored at least 55 papers between 1992 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Holonomy theorem for finite semigroups.
Int. J. Algebra Comput., 2022

On the rational subsets of the monogenic free inverse monoid.
CoRR, 2022

2021
Groups defined by automata.
Proceedings of the Handbook of Automata Theory., 2021

Rational subsets of groups.
Proceedings of the Handbook of Automata Theory., 2021

2020
Truncated boolean representable simplicial complexes.
Int. J. Algebra Comput., 2020

2018
Development of a QGIS Plugin to Obtain Parameters and Elements of Plantation Trees and Vineyards with Aerial Photographs.
ISPRS Int. J. Geo Inf., 2018

The lattice of flats of a boolean representable simplicial complex.
Int. J. Algebra Comput., 2018

On finitely generated submonoids of virtually free groups.
Groups Complex. Cryptol., 2018

2017
On uniformly continuous functions for some profinite topologies.
Theor. Comput. Sci., 2017

Equations Over Free Inverse Monoids with Idempotent Variables.
Theory Comput. Syst., 2017

On the topology of a boolean representable simplicial complex.
Int. J. Algebra Comput., 2017

On finitely generated submonoids of free groups.
CoRR, 2017

2016
The semaphore codes attached to a Turing machine via resets and their various limits.
Int. J. Algebra Comput., 2016

Random walks on semaphore codes and delay de Bruijn semigroups.
Int. J. Algebra Comput., 2016

iFloW: An Integrated Logistics Software System for Inbound Supply Chain Traceability.
Proceedings of the Enterprise Interoperability VII: Enterprise Interoperability in the Digitized and Networked Factory of the Future, 2016

Using Scrum Together with UML Models: A Collaborative University-Industry R&D Software Project.
Proceedings of the Computational Science and Its Applications - ICCSA 2016, 2016

2015
A new notion of vertex independence and rank for finite graphs.
Int. J. Algebra Comput., 2015

2014
A noncommutative extension of Mahler's theorem on interpolation series.
Eur. J. Comb., 2014

2013
On periodic Points of Free inverse Monoid Homomorphisms.
Int. J. Algebra Comput., 2013

2012
Groups and Automata: a Perfect Match.
J. Autom. Lang. Comb., 2012

Fixed points of endomorphisms of certain free products.
RAIRO Theor. Informatics Appl., 2012

Further Results on Monoids Acting on Trees.
Int. J. Algebra Comput., 2012

On periodic points of free inverse monoid endomorphisms
CoRR, 2012

Fixed points of endomorphisms of trace monoids
CoRR, 2012

Fixed points of endomorphisms of virtually free groups
CoRR, 2012

2011
Finite Idempotent Inverse Monoid Presentations.
Int. J. Algebra Comput., 2011

On Profinite Uniform Structures Defined by Varieties of Finite Monoids.
Int. J. Algebra Comput., 2011

Never Minimal Automata and the Rainbow Bipartite Subgraph Problem.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
Automorphic orbits in Free Groups: Words versus Subgroups.
Int. J. Algebra Comput., 2010

Computing Maximal Error-detecting Capabilities and Distances of Regular Languages.
Fundam. Informaticae, 2010

Rational subsets of groups
CoRR, 2010

Groups defined by automata
CoRR, 2010

2009
Infinite Words and Confluent Rewriting Systems: Endomorphism Extensions.
Int. J. Algebra Comput., 2009

2008
Rational subsets of partially reversible monoids.
Theor. Comput. Sci., 2008

Turing machines and bimachines.
Theor. Comput. Sci., 2008

Maximal Error-Detecting Capabilities of Formal Languages.
J. Autom. Lang. Comb., 2008

On an algorithm to decide whether a free group is a free factor of another.
RAIRO Theor. Informatics Appl., 2008

A Mahler's theorem for functions from words to integers.
Proceedings of the STACS 2008, 2008

2005
A topological approach to transductions.
Theor. Comput. Sci., 2005

On a Class of Automata Groups Generalizing Lamplighter Groups.
Int. J. Algebra Comput., 2005

2004
Free group languages: Rational versus recognizable.
RAIRO Theor. Informatics Appl., 2004

An Application of First-Order Logic to The Study of Recognizable Languages.
Int. J. Algebra Comput., 2004

2003
The homomorphism problem for trace monoids.
Theor. Comput. Sci., 2003

On Fine and Wilf's theorem for bidimensional words.
Theor. Comput. Sci., 2003

Periodicity vectors for labelled trees.
Discret. Appl. Math., 2003

A note on pure and p-pure languages.
Acta Informatica, 2003

2002
Extensions and submonoids of automatic monoids.
Theor. Comput. Sci., 2002

On the lattice of prefix codes.
Theor. Comput. Sci., 2002

Recognizable subsets of a group: finite extensions and the abelian case.
Bull. EATCS, 2002

The homomorphism problem for the free monoid.
Discret. Math., 2002

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

1999
Implementing MPI-2 Extended Collective Operations.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 1999

1996
On Free Inverse Monoid Languages.
RAIRO Theor. Informatics Appl., 1996

Conjugacy and Transposition for Inverse Monoid Presentations.
Int. J. Algebra Comput., 1996

1992
Rational Languages and Inverse Monoid Presentations.
Int. J. Algebra Comput., 1992


  Loading...