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.

@inproceedings{BosscherG96,
  title = {Regularity for a Large Class of Context-Free Processes is Decidable},
  author = {D. J. B. Bosscher and W. O. David Griffioen},
  year = {1996},
  tags = {context-aware},
  researchr = {https://researchr.org/publication/BosscherG96},
  cites = {0},
  citedby = {0},
  pages = {182-193},
  booktitle = {Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings},
  editor = {Friedhelm Meyer auf der Heide and Burkhard Monien},
  volume = {1099},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-61440-0},
}