On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Well-structured transition systems everywhere!
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
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
A Short Introduction to Infinite Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Computation: finite and infinite machines
Computation: finite and infinite machines
Reachability Problems on Regular Ground Tree Rewriting Graphs
Theory of Computing Systems
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On Bifix Systems and Generalizations
Language and Automata Theory and Applications
Communication of two stacks and rewriting
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Transition graphs of rewriting systems over unranked trees
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Automata for infinite argumentation structures
Artificial Intelligence
| Hi-index | 0.00 |
We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is central for automatic verification of infinite-state systems. Our focus is on graphs that are presented in terms of word or tree rewriting systems.