Recoverable formal language

DOI10.1134/S0032946022030073MaRDI QIDQ6173464zbMATH OpenOpenAlexFDO

Authors Michael L. Blank

Publication date 21 July 2023

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0032946022030073

zbMATH Keywords

codingdynamical systemformal languageshadowing of pseudo-trajectories

Mathematics Subject Classification ID

Applications of graph theory (05C90) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Efficient coding of formalized messages
• Maximal error-detecting capabilities of formal languages
• Relativized codes
• Separating signal from noise
• Efficient reconstruction of sequences

Cites work

• scientific article; zbMATH DE number 3847301 (Why is no real title available?)
• scientific article; zbMATH DE number 3672160 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1014071 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 776267 (Why is no real title available?)
• scientific article; zbMATH DE number 3384505 (Why is no real title available?)
• Metric properties of ε-trajectories of dynamical systems with stochastic behaviour

Cited in

(1)

• How to read a randomly mixed up message

This page was built for publication: Recoverable formal language

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