A simple proof of Valiant's lemma

DOI10.1051/ITA/1986200201831zbMATH Open0606.68075OpenAlexW95396034WikidataQ124935970 ScholiaQ124935970MaRDI QIDQ3745310

Hermann K.-G. Walter

Publication date: 1986

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92255

zbMATH Keywords

transitive closuredividing matrices into submatricesmatrix closuresrecognition problem of context-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Matrices over special rings (quaternions, finite fields, etc.) (15B33)

Cites Work

• General context-free recognition in less than cubic time
• Title not available (Why is that?)

This page was built for publication: A simple proof of Valiant's lemma

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745310)