The complexity of regular abstractions of one-counter languages (Q4635876)
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: The complexity of regular abstractions of one-counter languages |
scientific article; zbMATH DE number 6863490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of regular abstractions of one-counter languages |
scientific article; zbMATH DE number 6863490 |
Statements
The complexity of regular abstractions of one-counter languages (English)
0 references
23 April 2018
0 references
Parikh image
0 references
downward closure
0 references
one-counter automata
0 references
upward closure
0 references
0.7606375217437744
0 references
0.7582662105560303
0 references
0.7527795433998108
0 references
0.7494419813156128
0 references
