Decidability of involution hypercodes

DOI10.1016/j.tcs.2014.07.016zbMath1360.68549OpenAlexW1977821723MaRDI QIDQ401315

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

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

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)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effective constructions in well-partially-ordered free monoids
• Coding properties of DNA languages.
• Distances between languages and reflexivity of relations
• Trajectory-based codes
• The size of Higman-Haines sets
• Prefix-free regular languages and pattern matching
• 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
• THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE
• On free monoids partially ordered by embedding
• A variant of a recursively unsolvable problem
• More on the Size of Higman-Haines Sets: Effective Constructions

This page was built for publication: Decidability of involution hypercodes