On the complexity of computing the co-lexicographic width of a regular language (Q6845959)
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 8171265
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computing the co-lexicographic width of a regular language |
scientific article; zbMATH DE number 8171265 |
Statements
On the complexity of computing the co-lexicographic width of a regular language (English)
0 references
12 March 2026
0 references
sorting
0 references
indexing
0 references
regular languages
0 references
Wheeler automata
0 references
parameterized complexity
0 references
