95 search results - page 12 / 19 » Combinatorics on words |
CPM
2004
Springer
14 years 1 months ago
2004
Springer
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
CPM
2007
Springer
14 years 11 days ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
COLING
1996
13 years 9 months ago
1996
I describe a very simple HPSG analysis for partial verb phrase fronting. I will argue that the presented account is more adequate than others made during the past years because it...
CPM
1995
Springer
14 years 5 hour ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
ICALP
2001
Springer
14 years 28 days ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...