Characterizations of the decidability of some problems for regular trace languages
Theory of Computing Systems1989Vol. 22(1), pp. 1–19
Citations Over TimeTop 24% of 1989 papers
Related Papers
- → FO^2 with one transitive relation is decidable(2013)48 cited
- → The Boundary Between Decidability and Undecidability for Transitive-Closure Logics(2004)84 cited
- → UNDECIDABILITY OF LANGUAGE EQUIVALENCE FOR GENERALIZED REGULAR EXPRESSIONS(1996)1 cited
- → Some decision problems for traces(1997)23 cited
- → Interactive L systems with a fast local growth(1988)