Flavio D'Alessandro

Theor. Comput. Sci., 2021

On the Commutative Equivalence of Algebraic Formal Series and Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

On finite-index indexed grammars and their restrictions.

[BibT_eX]

[DOI]

Oscar H. Ibarra

Ian McQuillan

Inf. Comput., 2021

2020

Coding by minimal linear grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

2019

Locally Strongly Transitive Automata in the Černý Conjecture and Related Problems.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2019

On the Commutative Equivalence of Bounded Semi-linear Codes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018

Language classes associated with automata over matrix groups.

[BibT_eX]

[DOI]

Özlem Salehi

A. C. Cem Say

RAIRO Theor. Informatics Appl., 2018

On the Commutative Equivalence of Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

On incomplete and synchronizing finite sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Generalized Results on Monoids as Memory.

[BibT_eX]

[DOI]

Özlem Salehi

A. C. Cem Say

Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

2016

Homing vector automata.

[BibT_eX]

[DOI]

Özlem Salehi

A. C. Cem Say

RAIRO Theor. Informatics Appl., 2016

2015

On the commutative equivalence of bounded context-free and regular languages: The semi-linear case.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On the commutative equivalence of semi-linear sets of N<sup>k</sup>.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On the commutative equivalence of bounded context-free and regular languages: The code case.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

2014

On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages.

[BibT_eX]

[DOI]

Alberto Bertoni

Int. J. Found. Comput. Sci., 2014

Cerny-like problems for finite sets of words.

[BibT_eX]

[DOI]

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013

Independent sets of words and the synchronization problem.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2013

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem.

[BibT_eX]

[DOI]

Alberto Bertoni

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

Quasi-polynomials, linear Diophantine equations and semi-linear sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Regularity of languages defined by formal series with isolated cut point.

[BibT_eX]

[DOI]

Alberto Bertoni

Maria Paola Bianchi

RAIRO Theor. Informatics Appl., 2012

2010

On Bounded Rational Trace Languages.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

The Parikh counting functions of sparse context-free languages are quasi-polynomials.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On some counting problems for semi-linear sets

[BibT_eX]

[DOI]

CoRR, 2009

Strongly transitive automata and the Cerný conjecture.

[BibT_eX]

[DOI]

Acta Informatica, 2009

The Synchronization Problem for Locally Strongly Transitive Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Synchronizing Automata and Independent Systems of Words.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008

On the Growth of Context-Free Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2008

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

[BibT_eX]

[DOI]

CoRR, 2008

Well Quasi-orders in Formal Language Theory.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

The Synchronization Problem for Strongly Transitive Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007

Well quasi-orders generated by a word-shuffle rewriting.

[BibT_eX]

[DOI]

Gwénaël Richomme

Theor. Comput. Sci., 2007

On the separability of sparse context-free languages and of bounded rational relations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

2006

On the structure of the counting function of sparse context-free languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

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

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2006

A Non-commutativity Statement for Algebraic Quaternions.

[BibT_eX]

[DOI]

Alessandro D'Andrea

Int. J. Algebra Comput., 2006

Well Quasi Orders and the Shuffle Closure of Finite Sets.

[BibT_eX]

[DOI]

Gwénaël Richomme

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2004

Well quasi-orders and context-free grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Free Groups of Quaternions.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2004

Avoidable Sets and Well Quasi-Orders.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

2003

The finite power property in free groups.

[BibT_eX]

[DOI]

Jacques Sakarovitch

Theor. Comput. Sci., 2003

On the Complexity of Simon Automata over the Dyck Language.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

On Well Quasi-orders on Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002

A combinatorial problem on Trapezoidal words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

1998

Commutativity in Free Inverse Monoids.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

1997

A Note on the Multiplicative Group of a Division Ring.

[BibT_eX]

[DOI]