Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
A method for enumerating cosets of a group presented by a canonical system
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems
Theoretical Computer Science
Automated reasoning (2nd ed.): introduction and applications
Automated reasoning (2nd ed.): introduction and applications
Handbook of theoretical computer science (vol. B)
String-rewriting systems
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Thue specifications and their monadic second-order properties
Fundamenta Informaticae
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Thue Specifications, Infinite Graphs and Synchronized Product
Fundamenta Informaticae
| Hi-index | 0.00 |
In (possibly infinite) deterministic labeled transition systems defined by Thue congruences, labels are considered as functions of states into states. This paper provides a method for computing domains of such functions for a large class of transition systems. The latter are related to model checking of transition systems defined by Thue congruences.