Subword conditions and subword histories

Authors:
Arto Salomaa;Sheng Yu
Affiliations:
Turku Centre for Computer Science, Lemminkäisenkatu 14, 20520 Turku, Finland;Department of Computer Science, The University of Western Ontario, London, Ont., Canada N6A 5B7
Venue:
Information and Computation
Year:
2006

Citing 8
Cited 5

Decision problems for patterns

Journal of Computer and System Sciences
On Context-Free Languages

Journal of the ACM (JACM)
Words and special factors

Theoretical Computer Science
Handbook of Formal Languages

Handbook of Formal Languages
Semirings, Automata and Languages

Semirings, Automata and Languages
Extending Parikh matrices

Theoretical Computer Science
Subword histories and Parikh matrices

Journal of Computer and System Sciences
Reconstruction from subsequences

Journal of Combinatorial Theory Series A

Subsequence Invariants

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Subword histories and associated matrices

Theoretical Computer Science
On highly palindromic words

Discrete Applied Mathematics
Criteria for the matrix equivalence of words

Theoretical Computer Science
Subword balance, position indices and power sums

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces the notion of a subword condition and investigates languages defined by them. The special case, where the language reduces to one word, concerns the inference of a sequence from its subsequences. We obtain various characterization and decidability results for languages defined by subword conditions. The results contribute to the theory of Parikh matrices and arithmetizing the study of words. An important notion from early automata theory, that of a quasi-uniform event, plays a central role in our characterization.