Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages (Q6169895)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7726951
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages |
scientific article; zbMATH DE number 7726951 |
Statements
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages (English)
0 references
15 August 2023
0 references
automata
0 references
DFA
0 references
enumeration
0 references
radix
0 references
order
0 references
complexity
0 references
0 references
0.7827187776565552
0 references
0.7706363201141357
0 references
0.761670708656311
0 references
