On Non-complete Sets and Restivo’s Conjecture

DOI10.1007/978-3-642-22321-1_21zbMath1221.68180OpenAlexW1636572489MaRDI QIDQ5199968

Elena V. Pribavkina, Vladimir V. Gusev

Publication date: 29 July 2011

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22321-1_21

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (4)

On the length of uncompletable words in unambiguous automata ⋮ On incomplete and synchronizing finite sets ⋮ On finite monoids over nonnegative integer matrices and short killing words ⋮ On Nonnegative Integer Matrices and Short Killing Words

This page was built for publication: On Non-complete Sets and Restivo’s Conjecture