Efficient coding of formalized messages

DOI10.1007/BF01125416zbMath0875.68384OpenAlexW2094627536MaRDI QIDQ1816135

I. A. Sheremet

Publication date: 6 January 1997

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01125416

zbMATH Keywords

data compressiondecodingcoding of sentencesstochastic context-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25) Decoding (94B35)

Cites Work

• An undecidable problem for context-free grammars
• Optimization of LR(k) parsers
• Data compression
• On Complexity and Syntactic Information
• Solution by the establishment method of boundary value problems on eigenvalues
• Associate languages and derivational complexity of formal grammars and languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient coding of formalized messages