Checking Simple Properties of Transition Systems Defined by Thue Specifications
Journal of Automated Reasoning
Thue Specifications, Infinite Graphs and Synchronized Product
Fundamenta Informaticae
Bottom-up rewriting is inverse recognizability preserving
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Decidability and complexity in automatic monoids
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Thue Specifications, Infinite Graphs and Synchronized Product
Fundamenta Informaticae
Hi-index | 0.01 |