Grammars with a partitioned alphabet and deterministic CF-languages

MaRDI QIDQ797000zbMATH OpenFDO

Authors L. V. Surkova

Publication date 1983

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

deterministic context-free languageRSA-grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Cited in

(2)

• On the existence of generators of a CF-grammar for an arbitrary linear Diophantine system
• STRONG THEORETICAL STEGNOGRAPHY

This page was built for publication: Grammars with a partitioned alphabet and deterministic CF-languages

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