article · Virtual Community of Pathological Anatomy (University of Castilla La Mancha) · 1992

A polynomial-time parsing algorithm for a class of nondeterministic two-stack automata

CHERUBINI, ALESSANDRA, SAN PIETRO, PIERLUIGI

Cited by 0Abstract and details only

Abstract

The index has no abstract for this paper.

Cite this paper

CHERUBINI, A., & SAN PIETRO, P. (1992). A polynomial-time parsing algorithm for a class of nondeterministic two-stack automata. Virtual Community of Pathological Anatomy (University of Castilla La Mancha).

MLA 9

CHERUBINI, ALESSANDRA, and PIERLUIGI SAN PIETRO. “A polynomial-time parsing algorithm for a class of nondeterministic two-stack automata.” Virtual Community of Pathological Anatomy (University of Castilla La Mancha), 1992.

Chicago

CHERUBINI, ALESSANDRA, and PIERLUIGI SAN PIETRO. 1992. “A polynomial-time parsing algorithm for a class of nondeterministic two-stack automata.” Virtual Community of Pathological Anatomy (University of Castilla La Mancha).

Harvard

CHERUBINI, A. and SAN PIETRO, P. (1992) ‘A polynomial-time parsing algorithm for a class of nondeterministic two-stack automata’, Virtual Community of Pathological Anatomy (University of Castilla La Mancha).

BibTeX

@article{cherubini1992polynomial,
  title = {{A polynomial-time parsing algorithm for a class of nondeterministic two-stack automata}},
  author = {CHERUBINI, ALESSANDRA and SAN PIETRO, PIERLUIGI},
  journal = {Virtual Community of Pathological Anatomy (University of Castilla La Mancha)},
  year = {1992}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.