When input-driven pushdown automata meet reversiblity (Q2969982)
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: When input-driven pushdown automata meet reversiblity |
scientific article; zbMATH DE number 6697041
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | When input-driven pushdown automata meet reversiblity |
scientific article; zbMATH DE number 6697041 |
Statements
When input-driven pushdown automata meet reversiblity (English)
0 references
24 March 2017
0 references
reversible computation
0 references
input-driven pushdown automata
0 references
formal languages
0 references
closure properties
0 references
0 references
0 references
0 references
0.91101134
0 references
0.9034757
0 references
0 references
0.87889206
0 references
0.87542975
0 references
0.87517595
0 references
0.87517595
0 references
