Algorithmic ways of deciding whether an infinite language is a code

DOI10.1007/BF02367716MaRDI QIDQ1912449zbMATH OpenFDO

Authors N. Z. Gabbasov

Publication date 30 May 1996

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

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

zbMATH Keywords

codeinfinite language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Some algorithms on the star operation applied to finite languages
• Finite non-codes revisited from algorithmic points of view
• On codes having no finite completions
• A note on the free submonoids of the monoid of prefix codes
• scientific article; zbMATH DE number 3988734

Cited in

(29)

• A characterization of s-languages
• The structure of generalized code chains
• Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson
• The base of the intersection of two free submonoids
• Codes induced by alternative codes
• Anti-commutative languages and n-codes
• On alphabetic coding for superwords
• Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
• Generalizations of code languages with marginal errors
• scientific article; zbMATH DE number 4143910 (Why is no real title available?)
• Compatibility relations on codes and free monoids
• The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets
• Non sharing border codes
• scientific article; zbMATH DE number 3932413 (Why is no real title available?)
• scientific article; zbMATH DE number 3930882 (Why is no real title available?)
• scientific article; zbMATH DE number 3988734 (Why is no real title available?)
• On infinitary finite length codes
• A property of biprefix codes
• scientific article; zbMATH DE number 4081465 (Why is no real title available?)
• scientific article; zbMATH DE number 125885 (Why is no real title available?)
• scientific article; zbMATH DE number 1154540 (Why is no real title available?)
• It is decidable whether or not a permutation-free morphism is an l code
• Finite non-codes revisited from algorithmic points of view
• Languages with membership determined by single letter factors
• Quadratic algorithms for testing of codes and \(\diamond\)-codes
• scientific article; zbMATH DE number 2219557 (Why is no real title available?)
• Unique decipherability in the monoid of languages: an application of rational relations
• L codes and number systems
• Some algorithms on the star operation applied to finite languages

This page was built for publication: Algorithmic ways of deciding whether an infinite language is a code

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