Pedro V. Silva

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

Collaborative distances:



In proceedings 
PhD thesis 




On finitely generated submonoids of virtually free groups.
Groups Complexity Cryptology, 2018

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.
IJAC, 2017

The semaphore codes attached to a Turing machine via resets and their various limits.
IJAC, 2016

Random walks on semaphore codes and delay de Bruijn semigroups.
IJAC, 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

A new notion of vertex independence and rank for finite graphs.
IJAC, 2015

Equations over Free Inverse Monoids with Idempotent Variables.
Proceedings of the Computer Science - Theory and Applications, 2015

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

On periodic Points of Free inverse Monoid Homomorphisms.
IJAC, 2013

Groups and Automata: a Perfect Match.
Journal of Automata, Languages and Combinatorics, 2012

Fixed points of endomorphisms of certain free products.
RAIRO - Theor. Inf. and Applic., 2012

Further Results on Monoids Acting on Trees.
IJAC, 2012

Groups and Automata: A Perfect Match.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

Finite Idempotent Inverse Monoid Presentations.
IJAC, 2011

On Profinite Uniform Structures Defined by Varieties of Finite Monoids.
IJAC, 2011

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

Automorphic orbits in Free Groups: Words versus Subgroups.
IJAC, 2010

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

Infinite Words and Confluent Rewriting Systems: Endomorphism Extensions.
IJAC, 2009

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.
Journal of Automata, Languages and Combinatorics, 2008

On an algorithm to decide whether a free group is a free factor of another.
ITA, 2008

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

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

On a Class of Automata Groups Generalizing Lamplighter Groups.
IJAC, 2005

Free group languages: Rational versus recognizable.
ITA, 2004

An Application of First-Order Logic to The Study of Recognizable Languages.
IJAC, 2004

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.
Discrete Applied Mathematics, 2003

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

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.
Bulletin of the EATCS, 2002

The homomorphism problem for the free monoid.
Discrete Mathematics, 2002

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

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

On Free Inverse Monoid Languages.
ITA, 1996

Conjugacy and Transposition for Inverse Monoid Presentations.
IJAC, 1996

Rational Languages and Inverse Monoid Presentations.
IJAC, 1992