X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (63) 63
Conference Proceeding (25) 25
Publication (21) 21
Book Chapter (3) 3
Book / eBook (2) 2
Dissertation (1) 1
Web Resource (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
computer science (32) 32
computer science - formal languages and automata theory (21) 21
computer science - discrete mathematics (19) 19
algorithms (18) 18
computer science, theory & methods (16) 16
formal languages and automata theory (13) 13
mathematics - combinatorics (13) 13
computer science - data structures and algorithms (12) 12
combinatorics on words (11) 11
mathematics (11) 11
sturmian words (8) 8
combinatorics (7) 7
computation and language (7) 7
mathematical analysis (7) 7
abelian period (6) 6
data structures and algorithms (6) 6
string algorithms (6) 6
complexity (5) 5
data structures (5) 5
discrete mathematics (5) 5
forbidden words (5) 5
parikh vectors (5) 5
special factors (5) 5
text algorithms (5) 5
theoretical computer science (5) 5
[info.info-ds]computer science [cs]/data structures and algorithms [cs.ds] (4) 4
algorithm analysis and problem complexity (4) 4
alphabets (4) 4
analysis (4) 4
artificial intelligence (4) 4
circular words (4) 4
computer science, information systems (4) 4
discrete mathematics in computer science (4) 4
palindromes (4) 4
[info]computer science [cs] (3) 3
[math.math-co]mathematics [math]/combinatorics [math.co] (3) 3
absent words (3) 3
approximation (3) 3
average case analysis (3) 3
computation (3) 3
computation by abstract devices (3) 3
cyclic complexity (3) 3
design of algorithms (3) 3
enumeration (3) 3
enumerative formula (3) 3
factor automaton (3) 3
factor complexity (3) 3
mathematical logic and formal languages (3) 3
mathematical models (3) 3
mathematics, applied (3) 3
minimal forbidden factor (3) 3
pattern matching (3) 3
permuted strings (3) 3
studies (3) 3
sturmian word (3) 3
trapezoidal words (3) 3
weak repetition (3) 3
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (2) 2
[ info.info-fl ] computer science [cs]/formal languages and automata theory [cs.fl] (2) 2
[formula omitted]-words (2) 2
abelian power (2) 2
abelian repetition (2) 2
abelian run (2) 2
anti-power (2) 2
application software (2) 2
automata theory (2) 2
automation (2) 2
binary jumbled pattern matching (2) 2
binary languages (2) 2
christoffel words (2) 2
circular dna (2) 2
circular word (2) 2
closed word (2) 2
combinatorial properties (2) 2
computational complexity (2) 2
construction (2) 2
database management (2) 2
dealing (2) 2
electronic computers. computer science (2) 2
episturmian words (2) 2
formal languages (2) 2
image processing (2) 2
infinite word (2) 2
information storage and retrieval (2) 2
jumbled pattern matching (2) 2
kolakoski word (2) 2
lyndon words (2) 2
management information systems (2) 2
minimal forbidden words (2) 2
molecular computing (2) 2
polynomials (2) 2
pre-necklaces (2) 2
prefix normal words (2) 2
recognition (2) 2
repetition (2) 2
sequence comparison (2) 2
splicing systems (2) 2
strings (2) 2
suffix (2) 2
theory (2) 2
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal of Computer and System Sciences, ISSN 0022-0000, 06/2014, Volume 80, Issue 4, pp. 711 - 719
A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced... 
Sturmian words | Christoffel words | Minimal forbidden words | Enumerative formula | Special factors | SUFFIX | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | SEQUENCES | COMPLEXITY | COMPUTER SCIENCE, THEORY & METHODS | COMBINATORICS | FORBIDDEN WORDS | Balancing | Approximation | Planes | Mathematical analysis | Alphabets | Segments | Digital
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2011, Volume 412, Issue 29, pp. 3604 - 3615
The suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministic automaton recognizing the set of suffixes (resp. factors) of w .... 
DAWG | Combinatorics on words | Standard Sturmian words | Special factors | Suffix automaton | Factor automaton | FINITE WORDS | EPISTURMIAN WORDS | COMPUTER SCIENCE, THEORY & METHODS | SUBWORDS | TRAPEZOIDAL WORDS | Automation | Mathematical analysis | Recognition | Combinatorial analysis
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2015, Volume 565, pp. 90 - 101
We present a new framework for dealing with -words, based on their left and right frontiers. This allows us to give a compact representation of them, and to... 
Graphs | Representations | Dealing
Journal Article
Advances in Applied Mathematics, ISSN 0196-8858, 07/2019, Volume 108, pp. 67 - 78
An abelian antipower of order k (or simply an abelian k-antipower) is a concatenation of k consecutive words of the same length having pairwise distinct Parikh... 
Sierpiǹski word | Abelian antipower | Paperfolding word | k-antipower | Abelian complexity
Journal Article
Electronic Proceedings in Theoretical Computer Science, EPTCS, ISSN 2075-2180, 08/2011, Volume 63, pp. 129 - 137
Conference Proceeding
Electronic Proceedings in Theoretical Computer Science, ISSN 2075-2180, 08/2011, Volume 63, Issue Proc. WORDS 2011, pp. 129 - 137
EPTCS 63, 2011, pp. 129-137 Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian... 
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 11/2019, Volume 792, pp. 144 - 153
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have... 
Circular word | Finite automaton | Minimal forbidden factor | Fibonacci words | Factor automaton | SUFFIX | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2015, Volume 9304, pp. 122 - 134
Conference Proceeding
Information Processing Letters, ISSN 0020-0190, 09/2018, Volume 137, pp. 57 - 60
A string S[1,n] is a power (or tandem repeat) of order k and period n/k if it can be decomposed into k consecutive equal-length blocks of letters. Powers and... 
Anti-powers | Combinatorics on words | Algorithms | COMPUTER SCIENCE, INFORMATION SYSTEMS | Computer science
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 07/2017, Volume 684, pp. 29 - 42
An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain at most Θ(n2) distinct factors, and there... 
Sturmian word | Abelian square | Thue–Morse word | MAXIMUM NUMBER | COMPLEXITY | ENUMERATION | COMPUTER SCIENCE, THEORY & METHODS | Thue-Morse word
Journal Article
Journal of Discrete Algorithms, ISSN 1570-8667, 09/2014, Volume 28, pp. 41 - 48
We give an O(nlog⁡n)-time, O(n)-space algorithm for factoring a string into the minimum number of palindromic substrings. That is, given a string S[1..n], in... 
String algorithms | Palindromes | Factorization | Algorithms
Journal Article
Theory of Computing Systems, ISSN 1432-4350, 1/2012, Volume 50, Issue 1, pp. 35 - 51
Journal Article
Information Processing Letters, ISSN 0020-0190, 03/2016, Volume 116, Issue 3, p. 245
  We study a variation of the classical Shortest Common Superstring (SCS) problem in which a shortest superstring of a finite set of strings S is sought... 
Studies | Computer science | Algorithms | Approximations
Journal Article
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2017, Volume 10432, pp. 36 - 48
Conference Proceeding
Journal of Combinatorial Theory, Series A, ISSN 0097-3165, 07/2018, Volume 157, pp. 109 - 119
In combinatorics of words, a concatenation of k consecutive equal blocks is called a power of order k. In this paper we take a different point of view and... 
Infinite word | Anti-power | Unavoidable regularity | MATHEMATICS | Combinatorics | Mathematics
Journal Article
2011, Lecture Notes in Computer Science, ISBN 9783642223204, Volume 6795
Book Chapter
Theoretical Computer Science, ISSN 0304-3975, 01/2017, Volume 659, pp. 1 - 13
A 1-prefix normal word is a binary word with the property that no factor has more 1s than the prefix of the same length; a 0-prefix normal word is defined... 
Lyndon words | Binary languages | Enumeration | Prefix normal forms | Prefix normal words | Pre-necklaces | Binary jumbled pattern matching | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | Equivalence | Mathematical analysis | Rational functions | Mathematical models | Density | Pattern analysis
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.