Generalizations of Code Languages with Marginal Errors

DOI10.1007/978-3-319-21500-6_21zbMath1434.68255OpenAlexW2296356239MaRDI QIDQ3451108

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

Publication date: 10 November 2015

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21500-6_21

zbMATH Keywords

undecidabilitycontext-free languagesregular languagescodesdecision algorithmsmarginal errors

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On the complexity of decision problems for counter machines with applications to coding theory ⋮ On the complexity of decision problems for some classes of machines and applications ⋮ Edit distance neighbourhoods of input-driven pushdown automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata and forbidden words
• On the Ornstein-Uhlenbeck operators on Wiener-Riemannian manifolds
• Prefix-free regular languages and pattern matching
• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• AN IMPROVED PREFIX-FREE REGULAR-EXPRESSION MATCHING
• DFA with a Bounded Activity Level
• DNA Codes and Their Properties
• A Method for the Construction of Minimum-Redundancy Codes
• A variant of a recursively unsolvable problem

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