State complexity of transforming graph-walking automata to halting, returning and reversible (Q2687992)
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: State complexity of transforming graph-walking automata to halting, returning and reversible |
scientific article; zbMATH DE number 7660799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | State complexity of transforming graph-walking automata to halting, returning and reversible |
scientific article; zbMATH DE number 7660799 |
Statements
State complexity of transforming graph-walking automata to halting, returning and reversible (English)
0 references
7 March 2023
0 references
finite automata
0 references
graph-walking automata
0 references
halting
0 references
reversibility
0 references
0.8364300727844238
0 references
0.7845188975334167
0 references
0.7825833559036255
0 references
0.7052428722381592
0 references
0.6971723437309265
0 references
