A simple proof of Valiant's lemma
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1986)
- Volume: 20, Issue: 2, page 183-190
- ISSN: 0988-3754
Access Full Article
top
How to cite
topWalter, Hermann K.-G.. "A simple proof of Valiant's lemma." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 20.2 (1986): 183-190. <http://eudml.org/doc/92255>.
@article{Walter1986,
author = {Walter, Hermann K.-G.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {recognition problem of context-free languages; matrix closures; transitive closure; dividing matrices into submatrices},
language = {eng},
number = {2},
pages = {183-190},
publisher = {EDP-Sciences},
title = {A simple proof of Valiant's lemma},
url = {http://eudml.org/doc/92255},
volume = {20},
year = {1986},
}
TY - JOUR
AU - Walter, Hermann K.-G.
TI - A simple proof of Valiant's lemma
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1986
PB - EDP-Sciences
VL - 20
IS - 2
SP - 183
EP - 190
LA - eng
KW - recognition problem of context-free languages; matrix closures; transitive closure; dividing matrices into submatrices
UR - http://eudml.org/doc/92255
ER -
References
top- 1. M. A. HARRISON, Introduction to Formal Languages Theory, Addison-Wesley Pub. Co., Reading, Mass. 1978. Zbl0411.68058MR526397
- 2. L. VALIANT, General Context-free Recognition In Less Than Cubic Time, J. Comp. Syst. Sc., Vol. 10, 1975, pp. 308-315. Zbl0312.68042MR428796
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.