Checking stacks and context-free programmed grammars accept p-complete languages

E. Shamir; C. Beeri

doi:10.1007/3-540-06841-4_50

Checking stacks and context-free programmed grammars accept p-complete languages

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

11 Scopus citations

Original language	English
Title of host publication	Automata, Languages and Programming - 2nd Colloquium
Editors	J. Loeckx
Publisher	Springer Verlag
Pages	27-33
Number of pages	7
ISBN (Print)	9783540068419
DOIs	https://doi.org/10.1007/3-540-06841-4_50
State	Published - 1974
Event	2nd International Colloquium on Automata, Languages and Programming, ICALP 1974 - Saarbrucken, Germany Duration: 29 Jul 1974 → 2 Aug 1974

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	14 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	2nd International Colloquium on Automata, Languages and Programming, ICALP 1974
Country/Territory	Germany
City	Saarbrucken
Period	29/07/74 → 2/08/74

Access to Document

10.1007/3-540-06841-4_50

Cite this

Shamir, E., & Beeri, C. (1974). Checking stacks and context-free programmed grammars accept p-complete languages. In J. Loeckx (Ed.), Automata, Languages and Programming - 2nd Colloquium (pp. 27-33). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-06841-4_50

@inproceedings{f2fb945ceeaa42e8a36d6c7d169e26cb,

title = "Checking stacks and context-free programmed grammars accept p-complete languages",

author = "E. Shamir and C. Beeri",

year = "1974",

doi = "10.1007/3-540-06841-4_50",

language = "אנגלית",

isbn = "9783540068419",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "27--33",

editor = "J. Loeckx",

booktitle = "Automata, Languages and Programming - 2nd Colloquium",

address = "גרמניה",

note = "2nd International Colloquium on Automata, Languages and Programming, ICALP 1974 ; Conference date: 29-07-1974 Through 02-08-1974",

}

Shamir, E & Beeri, C 1974, Checking stacks and context-free programmed grammars accept p-complete languages. in J Loeckx (ed.), Automata, Languages and Programming - 2nd Colloquium. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14 LNCS, Springer Verlag, pp. 27-33, 2nd International Colloquium on Automata, Languages and Programming, ICALP 1974, Saarbrucken, Germany, 29/07/74. https://doi.org/10.1007/3-540-06841-4_50

Checking stacks and context-free programmed grammars accept p-complete languages. / Shamir, E.; Beeri, C.
Automata, Languages and Programming - 2nd Colloquium. ed. / J. Loeckx. Springer Verlag, 1974. p. 27-33 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Checking stacks and context-free programmed grammars accept p-complete languages

AU - Shamir, E.

AU - Beeri, C.

PY - 1974

Y1 - 1974

UR - http://www.scopus.com/inward/record.url?scp=84988347214&partnerID=8YFLogxK

U2 - 10.1007/3-540-06841-4_50

DO - 10.1007/3-540-06841-4_50

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84988347214

SN - 9783540068419

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 27

EP - 33

BT - Automata, Languages and Programming - 2nd Colloquium

A2 - Loeckx, J.

PB - Springer Verlag

T2 - 2nd International Colloquium on Automata, Languages and Programming, ICALP 1974

Y2 - 29 July 1974 through 2 August 1974

ER -

Shamir E , Beeri C. Checking stacks and context-free programmed grammars accept p-complete languages. In Loeckx J, editor, Automata, Languages and Programming - 2nd Colloquium. Springer Verlag. 1974. p. 27-33. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-06841-4_50

Checking stacks and context-free programmed grammars accept p-complete languages

Publication series

Conference

Access to Document

Other files and links

Cite this