Relational codes of words

Authors:
Vesa Halava;Tero Harju;Tomi Kärki
Affiliations:
Department of Mathematics and Turku Centre for Computer Science, University of Turku, FIN-20014 Turku, Finland;Department of Mathematics and Turku Centre for Computer Science, University of Turku, FIN-20014 Turku, Finland;Department of Mathematics and Turku Centre for Computer Science, University of Turku, FIN-20014 Turku, Finland
Venue:
Theoretical Computer Science
Year:
2007

Citing 16
Cited 3

Non-standard stringology: algorithms and complexity

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Text algorithms

Text algorithms
Partial words and a theorem of Fine and Wilf

Theoretical Computer Science
Partial words and a theorem of Fine and Wilf revisited

Theoretical Computer Science
Theory of Codes

Theory of Codes
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms

Introduction to Algorithms
Conjugacy on partial words

Theoretical Computer Science
Code Problems on Traces

MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Local periods and binary partial words: an algorithm

Theoretical Computer Science
Partial words and the critical factorization theorem

Journal of Combinatorial Theory Series A
Codes, orderings, and partial words

Theoretical Computer Science
Primitive partial words

Discrete Applied Mathematics
Partial words for DNA coding

DNA'04 Proceedings of the 10th international conference on DNA computing
A fast test for unique decipherability based on suffix trees (Corresp.)

IEEE Transactions on Information Theory
Deciding multiset decipherability

IEEE Transactions on Information Theory

Overlap-freeness in infinite partial words

Theoretical Computer Science
Directed figure codes with weak equality

IDEAL'10 Proceedings of the 11th international conference on Intelligent data engineering and automated learning
Repetition-freeness with Cyclic Relations and Chain Relations

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider words, i.e. strings over a finite alphabet together with a similarity relation induced by a compatibility relation on letters. This notion generalizes that of partial words. The theory of codes on combinatorics on words is revisited by defining (R,S)-codes for arbitrary similarity relations R and S. We describe an algorithm to test whether or not a finite set of words is an (R,S)-code. Coding properties of finite sets of words are explored by finding maximal and minimal relations with respect to relational codes.