Graph reachability and pebble automata over infinite alphabets (Q2946705)
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: Graph reachability and pebble automata over infinite alphabets |
scientific article; zbMATH DE number 6483207
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph reachability and pebble automata over infinite alphabets |
scientific article; zbMATH DE number 6483207 |
Statements
Graph Reachability and Pebble Automata over Infinite Alphabets (English)
0 references
17 September 2015
0 references
graph reachability
0 references
infinite alphabets
0 references
pebble automata
0 references
0.8077917098999023
0 references
0.7529076337814331
0 references
0.742004930973053
0 references
