scientific article; zbMATH DE number 8007

MaRDI QIDQ3970809zbMATH OpenFDO

Authors L. P. Zhil'tsova

Publication date 25 June 1992

zbMATH Keywords

alphabetical codingcontext-free languagesdeterministic languagesfinite-automaton decodingregular languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3907801
• The conditional distribution of the output of an automaton without memory for given characteristics of the input
• scientific article; zbMATH DE number 2032367
• scientific article; zbMATH DE number 1337738
• scientific article; zbMATH DE number 1535454

Cited in

(10)

• Efficient coding of formalized messages
• On alphabetic coding for superwords
• scientific article; zbMATH DE number 3889419 (Why is no real title available?)
• scientific article; zbMATH DE number 4211495 (Why is no real title available?)
• scientific article; zbMATH DE number 3907800 (Why is no real title available?)
• scientific article; zbMATH DE number 3907801 (Why is no real title available?)
• scientific article; zbMATH DE number 3930882 (Why is no real title available?)
• scientific article; zbMATH DE number 1535454 (Why is no real title available?)
• The conditional distribution of the output of an automaton without memory for given characteristics of the input
• Alphabetic coding with exponential costs

This page was built for publication:

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