Flavio D'Alessandro

According to our database1, Flavio D'Alessandro
  • authored at least 47 papers between 1997 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
On incomplete and synchronizing finite sets.
Theor. Comput. Sci., 2017

Generalized Results on Monoids as Memory.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

On Finite-Index Indexed Grammars and Their Restrictions.
Proceedings of the Language and Automata Theory and Applications, 2017

2016
Homing vector automata.
RAIRO - Theor. Inf. and Applic., 2016

Homing vector automata.
CoRR, 2016

Language Classes Associated with Automata Over Matrix Groups.
CoRR, 2016

On Finite-Index Indexed Grammars and Their Restrictions.
CoRR, 2016

On incomplete and synchronizing finite sets.
CoRR, 2016

Language classes associated with automata over matrix groups.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

2015
On the commutative equivalence of bounded context-free and regular languages: The semi-linear case.
Theor. Comput. Sci., 2015

On the commutative equivalence of semi-linear sets of Nk.
Theor. Comput. Sci., 2015

On the commutative equivalence of bounded context-free and regular languages: The code case.
Theor. Comput. Sci., 2015

2014
On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages.
Int. J. Found. Comput. Sci., 2014

Cerny-like problems for finite sets of words.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013
Quantum finite automata and linear context-free languages: a decidable problem
CoRR, 2013

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Quasi-polynomials, linear Diophantine equations and semi-linear sets.
Theor. Comput. Sci., 2012

Regularity of languages defined by formal series with isolated cut point.
RAIRO - Theor. Inf. and Applic., 2012

2011
Independent sets of words and the synchronization problem
CoRR, 2011

Regularity of Languages Defined by Formal Series with Isolated Cut Point.
Proceedings of the Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18, 2011

2010
On Bounded Rational Trace Languages.
Theory Comput. Syst., 2010

On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
The Parikh counting functions of sparse context-free languages are quasi-polynomials.
Theor. Comput. Sci., 2009

On some counting problems for semi-linear sets
CoRR, 2009

Strongly transitive automata and the Cerný conjecture.
Acta Inf., 2009

The Synchronization Problem for Locally Strongly Transitive Automata.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Synchronizing Automata and Independent Systems of Words.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008
On the Growth of Context-Free Languages.
Journal of Automata, Languages and Combinatorics, 2008

The Parikh functions of sparse context-free languages are quasi-polynomials
CoRR, 2008

Well Quasi-orders in Formal Language Theory.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

The Synchronization Problem for Strongly Transitive Automata.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007
Well quasi-orders generated by a word-shuffle rewriting.
Theor. Comput. Sci., 2007

On the separability of sparse context-free languages and of bounded rational relations.
Theor. Comput. Sci., 2007

2006
On the structure of the counting function of sparse context-free languages.
Theor. Comput. Sci., 2006

Well quasi-orders, unavoidable sets, and derivation systems.
ITA, 2006

A Non-commutativity Statement for Algebraic Quaternions.
IJAC, 2006

Well quasi-orders and the shuffle closure of finite sets
CoRR, 2006

Well Quasi Orders and the Shuffle Closure of Finite Sets.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2004
Well quasi-orders and context-free grammars.
Theor. Comput. Sci., 2004

Free Groups of Quaternions.
IJAC, 2004

Avoidable Sets and Well Quasi-Orders.
Proceedings of the Developments in Language Theory, 2004

2003
The finite power property in free groups.
Theor. Comput. Sci., 2003

On the Complexity of Simon Automata over the Dyck Language.
Journal of Automata, Languages and Combinatorics, 2003

On Well Quasi-orders on Languages.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
A combinatorial problem on Trapezoidal words.
Theor. Comput. Sci., 2002

1998
Commutativity in Free Inverse Monoids.
Theor. Comput. Sci., 1998

1997
A Note on the Multiplicative Group of a Division Ring.
IJAC, 1997


  Loading...