Table 1 Example grammar produced by Sequitur for the input sequence a b c a b d a b c a b d, demonstrating rules, expanded sequences and occurrence counts.

From: Quantifying free behaviour in an open field using k-motif approach

s

 

R(s)

expanded

c(s)

S

→

1 1

a b c a b d a b c a b d

1

1

→

2 c 2 d

a b c a b d

2

2

→

ab

a b

4

  1. Note that a, b, c, d are terminal symbols, and S, 1 and 2 are non-terminal symbols in this example.
Back to article page