Complexity results for multi-pebble automata and their logics (Q4632417)
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 7048665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results for multi-pebble automata and their logics |
scientific article; zbMATH DE number 7048665 |
Statements
Complexity results for multi-pebble automata and their logics (English)
0 references
29 April 2019
0 references
regular expression
0 references
regular language
0 references
finite automaton
0 references
exponential time
0 references
input word
0 references
0.9617357850074768
0 references
0.7547124028205872
0 references
0.7461926341056824
0 references
0.7274808883666992
0 references
0.7250732779502869
0 references
