On the complexity and decidability of some problems involving shuffle (Q1706154)
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: On the complexity and decidability of some problems involving shuffle |
scientific article; zbMATH DE number 6471671
- On the Complexity and Decidability of Some Problems Involving Shuffle
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity and decidability of some problems involving shuffle |
scientific article; zbMATH DE number 6471671 |
|
Statements
On the complexity and decidability of some problems involving shuffle (English)
0 references
On the Complexity and Decidability of Some Problems Involving Shuffle (English)
0 references
21 March 2018
0 references
7 August 2015
0 references
automata and logic
0 references
shuffle
0 references
counter machines
0 references
pushdown machines
0 references
reversal-bounds
0 references
determinism
0 references
commutativity
0 references
strings
0 references
0 references
0.9951303005218506
0 references
0.8348456621170044
0 references
0.814835786819458
0 references
0.7930307388305664
0 references
