Containing of Regular Languages in Non-Regular Timing Diagram Languages is Decidable

Kathi Fisler. Containing of Regular Languages in Non-Regular Timing Diagram Languages is Decidable. In Orna Grumberg, editor, Computer Aided Verification, 9th International Conference, CAV 97, Haifa, Israel, June 22-25, 1997, Proceedings. Volume 1254 of Lecture Notes in Computer Science, pages 155-166, Springer, 1997.

Abstract

Abstract is missing.