Context-Free Complexity of Finite Languages - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Walter Bucher, Hermann A. Maurer, Karel Culik II. Context-Free Complexity of Finite Languages. Theoretical Computer Science, 28:277-285, 1984.

@article{BucherMC84,
  title = {Context-Free Complexity of Finite Languages},
  author = {Walter Bucher and Hermann A. Maurer and Karel Culik II},
  year = {1984},
  tags = {context-aware},
  researchr = {https://researchr.org/publication/BucherMC84},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {28},
  pages = {277-285},
}

runs on WebDSL