The following pages link to The size of subsequence automaton (Q2566019):
Displaying 8 items.
- On the joint subword complexity of automatic sequences (Q837149) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- On the height of towers of subsequences and prefixes (Q2272979) (← links)
- Subsequence automata with default transitions (Q2363354) (← links)
- THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA (Q3646172) (← links)
- (Q4418625) (← links)
- String Processing and Information Retrieval (Q5897141) (← links)
- On problems related to absent subsequences (Q6606246) (← links)