Descriptional Complexity of Matrix Simple Semi-conditional Grammars

Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman

Open source

DOI
10.1007/978-3-030-23247-4_8
Published
2019
Container
Lecture Notes in Computer Science
Publisher
Springer International Publishing
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/978-3-030-23247-4_8,
  title = {Descriptional Complexity of Matrix Simple Semi-conditional Grammars},
  author = {Henning Fernau and Lakshmanan Kuppusamy and Indhumathi Raman},
  year = {2019},
  journal = {Lecture Notes in Computer Science},
  doi = {10.1007/978-3-030-23247-4_8},
  url = {https://doi.org/10.1007/978-3-030-23247-4_8}
}

RIS

TY  - JOUR
TI  - Descriptional Complexity of Matrix Simple Semi-conditional Grammars
AU  - Henning Fernau
AU  - Lakshmanan Kuppusamy
AU  - Indhumathi Raman
PY  - 2019
JO  - Lecture Notes in Computer Science
DO  - 10.1007/978-3-030-23247-4_8
UR  - https://doi.org/10.1007/978-3-030-23247-4_8
ER  - 

APA

Fernau, H., Kuppusamy, L., & Raman, I. (2019). Descriptional Complexity of Matrix Simple Semi-conditional Grammars. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-23247-4_8

Source records