Regularity for a large class of context-free processes is decidable

Additional Metadata
MSC	Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (msc 68Q10), Specification and verification (program logics, model checking, etc.) (msc 68Q60)
Publisher	Springer
Series	Lecture Notes in Computer Science
Conference	International Colloquium on Automata, Languages and Programming
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Bosscher, D., & Griffioen, W. O. D. (1996). Regularity for a large class of context-free processes is decidable. In Automata, Languages and Programming (pp. 182–193). Springer.

Publication