On the length of uncompletable words in unambiguous automata
Work
Year: 2019
Type: article
Abstract: This paper deals with uncomplete unambiguous automata. In this setting, we investigate the minimal length of uncompletable words. This problem is connected with a well-known conjecture formulated by A... more
Authors Antonio Boccuto, Arturo Carpi
Institution University of Perugia
Cites: 20
Cited by: 3
Related to: 10
FWCI: 0.33
Citation percentile (by year/subfield): 61
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze