The Delta Operation: From Strings to Trees to Strings
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Higher-Order Pushdown Trees Are Easy
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
The delta operation: from strings to trees to strings
Formal and natural computing
Model-Checking Games for Typed λ-Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
On the structure of graphs in the Caucal hierarchy
Theoretical Computer Science
Games on Higher Order Multi-stack Pushdown Systems
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Verification of higher-order computation: a game-semantic approach
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Some perspectives of infinite-state verification
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Regular sets over extended tree structures
Theoretical Computer Science
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
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Sequences of level 1, 2, 3,..., k,...
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Hierarchies of infinite structures generated by pushdown automata and recursion schemes
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Theory of Computing Systems
| Hi-index | 0.00 |