scientific article; zbMATH DE number 1406216
From MaRDI portal
Publication:4939253
Recommendations
- On the graph traversal method for evaluating linear binary-chain programs
- scientific article; zbMATH DE number 1852175
- A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes
- On algorithmic solvability of a completeness problem for linear automata
- Compilation and evaluation of linear mutual recursions
- scientific article; zbMATH DE number 3988715
- The Complexity of Tree Automata and Logics of Programs
Cited in
(7)- Graph traversal and top-down evaluation of logic queries
- Counting and topological order
- A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
- Efficient evaluation for a subset of recursive queries
- Grammars and automata to optimize chain logic queries
- On the graph traversal method for evaluating linear binary-chain programs
- Efficient evaluation of generalized left-linear recursive queries with multivalue binding sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4939253)
