Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free Languages

Priti Shankar, B. S. Adiga. Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free Languages. Theoretical Computer Science, 95(2):339-340, 1992.

@article{ShankarA92,
  title = {Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free Languages},
  author = {Priti Shankar and B. S. Adiga},
  year = {1992},
  tags = {rule-based, testing, graph-rewriting, context-aware, rewriting},
  researchr = {https://researchr.org/publication/ShankarA92},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {95},
  number = {2},
  pages = {339-340},
}