An automata-theoretical characterization of the OI-hierarchy
Information and Control
The monadic second-order logic of graphs IX: machines and their behaviours
Selected papers of the workshop on Topology and completion in semantics
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
The Complexity of Finite Memory Programs with Recursion
Journal of the ACM (JACM)
On full abstraction for PCF: I, II, and III
Information and Computation
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Higher-Order Pushdown Trees Are Easy
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Deciding monadic theories of hyperalgebraic trees
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Higher order pushdown automata, the Caucal hierarchy of graphs and parity games
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Idealized algol with ground recursion, and DPDA equivalence
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Unsafe grammars and panic automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A finite semantics of simply-typed lambda terms for infinite runs of automata
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Safety is not a restriction at level 2 for string languages
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Fundamenta Informaticae
Linear orders in the pushdown hierarchy
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Diagnosability of pushdown systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
| Hi-index | 0.00 |
Higher-order recursion schemes and higher-order pushdown automata are closely related methods for generating infinite hierarchies of infinite structures. Subsuming well-known classes of models of computation, these rich hierarchies (of word languages, trees, and graphs respectively) have excellent model-checking properties. In this extended abstract, we survey recent expressivity and decidability results about these infinite structures.