Tree Adjoining Languages and Multipushdown Languages

A. Cherubini, P. San Pietro

Open source

DOI
10.1007/s002240010004
Published
2000-06-01
Container
Theory of Computing Systems
Publisher
Springer Science and Business Media LLC
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/s002240010004,
  title = {Tree Adjoining Languages and Multipushdown Languages},
  author = {A. Cherubini and P. San Pietro},
  year = {2000},
  journal = {Theory of Computing Systems},
  doi = {10.1007/s002240010004},
  url = {https://doi.org/10.1007/s002240010004}
}

RIS

TY  - JOUR
TI  - Tree Adjoining Languages and Multipushdown Languages
AU  - A. Cherubini
AU  - P. San Pietro
PY  - 2000
JO  - Theory of Computing Systems
DO  - 10.1007/s002240010004
UR  - https://doi.org/10.1007/s002240010004
ER  - 

APA

Cherubini, A., & Pietro, P. S. (2000). Tree Adjoining Languages and Multipushdown Languages. Theory of Computing Systems. https://doi.org/10.1007/s002240010004

Source records