On bounded languages and reversal-bounded automata (Q899318)
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 6524288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On bounded languages and reversal-bounded automata |
scientific article; zbMATH DE number 6524288 |
Statements
On bounded languages and reversal-bounded automata (English)
0 references
28 December 2015
0 references
context-free language (CFL)
0 references
nondeterministic pushdown automaton (NPDA)
0 references
reversal-bounded
0 references
semilinear set
0 references
stratified linear set
0 references
0 references
0.9992780089378356
0 references
0.813169538974762
0 references
0.7789504528045654
0 references
0.7678390145301819
0 references
0.7675758600234985
0 references
