Term Rewriting and Applications
From MaRDI portal
Publication:5703871
DOI10.1007/b135673zbMath1078.68652MaRDI QIDQ5703871
Tayssir Touili, Ahmed Bouajjani
Publication date: 11 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b135673
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q42: Grammars and rewriting systems
Related Items
Rigid tree automata and applications, Equational approximations for tree automata completion, A note on partially ordered tree automata, Verifying parallel programs with dynamic communication structures, When Is Reachability Intrinsically Decidable?, On the Reachability Analysis of Acyclic Networks of Pushdown Systems, Rigid Tree Automata, Verifying Parallel Programs with Dynamic Communication Structures
Uses Software