State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752)
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 the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs |
scientific article; zbMATH DE number 7770237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs |
scientific article; zbMATH DE number 7770237 |
Statements
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (English)
0 references
24 November 2023
0 references
state complexity
0 references
finite automata
0 references
alphabetical pattern constraints
0 references
commutative closure
0 references
language inclusion problem
0 references
Parikh equivalence
0 references
partially ordered nondeterministic automata
0 references
0 references
0 references
