A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes (Q3000614)
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: A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes |
scientific article; zbMATH DE number 5897375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes |
scientific article; zbMATH DE number 5897375 |
Statements
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes (English)
0 references
19 May 2011
0 references
0.8360278606414795
0 references
0.8330574631690979
0 references
0.8322063088417053
0 references
0.83119797706604
0 references
0.8301525115966797
0 references
