Regularity for a Large Class of Context-Free Processes is Decidable

D. J. B. Bosscher, W. O. David Griffioen. Regularity for a Large Class of Context-Free Processes is Decidable. In Friedhelm Meyer auf der Heide, Burkhard Monien, editors, Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings. Volume 1099 of Lecture Notes in Computer Science, pages 182-193, Springer, 1996.

Abstract

Abstract is missing.