The regular viewpoint on PA-processes
Theoretical Computer Science
Decidability and Closure Properties of Equational Tree Languages
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism
Electronic Notes in Theoretical Computer Science (ENTCS)
Constrained Reachability of Process Rewrite Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Recognizing boolean closed A-tree languages with membership conditional rewriting mechanism
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Bottom-up rewriting is inverse recognizability preserving
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
Hi-index | 0.00 |