Journal of the ACM (JACM)
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
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
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Higher-Order Pushdown Trees Are Easy
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Iterated pushdown automata and complexity classes
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Symbolic reachability analysis of higher-order context-free processes
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Positional Strategies for Higher-Order Pushdown Parity Games
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Symbolic backwards-reachability analysis for higher-order pushdown systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Parametrized regular infinite games and higher-order pushdown strategies
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
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
Regular sets over extended tree structures
Theoretical Computer Science
The kleene equality for graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Prefix rewriting for nested-words and collapsible pushdown automata
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A saturation method for collapsible pushdown systems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
First-Order Logic on Higher-Order Nested Pushdown Trees
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pushdown automata and investigate, with a particular stress on effectiveness and complexity, the natural notion of regularity for higher-order stacks: a set of level k stacks is regular if it is obtained by a regular sequence of level k operations. We prove that any regular set of level k stacks admits a normalized representation and we use it to show that the regular sets of a given level form an effective Boolean algebra. In fact, this notion of regularity coincides with the notion of monadic second order definability over the canonical structure associated to level k stacks. Finally, we consider the link between regular sets of stacks and families of infinite graphs defined by higher-order pushdown systems.