Decidability of involution hypercodes

DOI10.1016/J.TCS.2014.07.016zbMATH Open1360.68549OpenAlexW1977821723MaRDI QIDQ401315FDOQ401315

Authors: Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko 

Publication date: 26 August 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.07.016

Recommendations

• Involutions in Binary Perfect Codes
• Decidability of multiset, set and numerically decipherable directed figure codes
• Some properties of involution codes
• Codes over hyperfields
• scientific article; zbMATH DE number 1426185
• k-involution codes and related sets
• scientific article; zbMATH DE number 2127764
• Undecidability of the trace coding problem and some decidable cases
• Directed figure codes: decidability frontier
• Directed figure codes: decidability frontier

zbMATH Keywords

decidabilityDNA codesedit-distanceinvolution hypercodes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Distances between languages and reflexivity of relations
• Title not available (Why is that?)
• Title not available (Why is that?)
• The edit-distance between a regular language and a context-free language
• A variant of a recursively unsolvable problem
• On free monoids partially ordered by embedding
• Effective constructions in well-partially-ordered free monoids
• Coding properties of DNA languages.
• Trajectory-based codes
• The size of Higman-Haines sets
• Prefix-free regular languages and pattern matching
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the state complexity of scattered substrings and superstrings
• Hypercodes
• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• Approximate matching between a context-free grammar and a finite-state automaton
• DNA Codes and Their Properties
• A formal language analysis of DNA hairpin structures
• Involution solid and join codes
• More on the Size of Higman-Haines Sets: Effective Constructions

Cited In (2)

• Disjunctivity and other properties of sets of pseudo-bordered words
• Generalizations of Code Languages with Marginal Errors

This page was built for publication: Decidability of involution hypercodes

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