A synergic approach to the minimal uncompletable words problem

DOI10.25596/JALC-2017-271MaRDI QIDQ4609174zbMATH OpenOpenAlexFDO

Authors Sandrine Julia, Arnaud Malapert, Julien Provillard

Publication date 29 March 2018

Full work available at URL https://hal.science/hal-01665399

zbMATH Keywords

automata theoryformal languagesRestivo's conjectureminimal uncompletable words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On non-complete sets and Restivo's conjecture
• On the length of uncompletable words in unambiguous automata
• On incomplete and synchronizing finite sets
• On codes with a finite deciphering delay: Constructing uncompletable words
• scientific article; zbMATH DE number 3849232

Cited in

(7)

• On Nonnegative Integer Matrices and Short Killing Words
• On the length of uncompletable words in unambiguous automata
• On non-complete sets and Restivo's conjecture
• On finite monoids over nonnegative integer matrices and short killing words
• Minimal Discriminating Words Problem Revisited
• The Frobenius and Factor Universality Problems of the Kleene Star of a Finite Set of Words
• On incomplete and synchronizing finite sets

This page was built for publication: A synergic approach to the minimal uncompletable words problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4609174)