State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: State complexity of permutation and related decision problems on alphabetical pattern constraints |
scientific article; zbMATH DE number 7495109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | State complexity of permutation and related decision problems on alphabetical pattern constraints |
scientific article; zbMATH DE number 7495109 |
Statements
State complexity of permutation and related decision problems on alphabetical pattern constraints (English)
0 references
22 March 2022
0 references
state complexity
0 references
finite automata
0 references
alphabetic pattern constraint language
0 references
commutative closure
0 references
inclusion problem
0 references
0.9270706
0 references
0 references
0 references
0.8703073
0 references
0.86449707
0 references
0.85571885
0 references
0.85193413
0 references
0.85193413
0 references
