Generalizations of Code Languages with Marginal Errors

DOI10.1142/S0129054121410057MaRDI QIDQ6114833zbMATH OpenOpenAlexFDO

Authors Sang-Ki Ko, Yo-Sub Han, Kai Salomaa

Publication date 15 August 2023

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054121410057

zbMATH Keywords

codescontext-free languagesundecidabilityregular languagesdecision algorithmsmarginal errors

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Generalizations of code languages with marginal errors
• scientific article; zbMATH DE number 148019
• Finite non-codes revisited from algorithmic points of view
• Quotient complexity of bifix-, factor-, and subword-free regular languages
• Generalized disjunctive languages defined by some kinds of codes

Cites work

• scientific article; zbMATH DE number 5605126 (Why is no real title available?)
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 1998341 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 194974 (Why is no real title available?)
• scientific article; zbMATH DE number 1568800 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• A variant of a recursively unsolvable problem
• An improved prefix-free regular-expression matching
• Automata and forbidden words
• Codes and automata.
• Completing biprefix codes
• Completion of recognizable bifix codes
• DFA with a Bounded Activity Level
• DNA Codes and Their Properties
• Decidability of involution hypercodes
• Duplications and pseudo-duplications
• Finite maximal infix codes
• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• Intercode regular languages
• Introduction to algorithms
• Maximal codes with bounded deciphering delay
• On the maximality of languages with combined types of code properties
• Prefix-free regular languages and pattern matching
• Pseudo-inversion: closure properties and decidability

Cited in

(4)

• On the complexity of decision problems for some classes of machines and applications
• On the complexity of decision problems for counter machines with applications to coding theory
• Generalizations of code languages with marginal errors
• Relativized codes, finite decodability, and bounded languages

This page was built for publication: Generalizations of Code Languages with Marginal Errors

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