12 papers:
CIAA-2015-HoffmannS #infinity #metric #word- Subword Metrics for Infinite Words (SH, LS), pp. 165–175.
LATA-2014-GantyR #order #verification- Ordered Counter-Abstraction — Refinable Subword Relations for Parameterized Verification (PG, AR), pp. 396–408.
DLT-2013-GocSS #complexity- Subword Complexity and k-Synchronization (DG, LS, JS), pp. 252–263.
AFL-2011-BrzozowskiJLS #complexity #regular expression- Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages (JAB, GJ, BL, JS), pp. 123–137.
ICPR-2010-FischerKFB #documentation #modelling #using #word- HMM-based Word Spotting in Handwritten Documents Using Subword Models (AF, AK, VF, HB), pp. 3416–3419.
- DLT-2008-CassaigneKZ #complexity #sequence
- Relationally Periodic Sequences and Subword Complexity (JC, TK, LQZ), pp. 196–205.
DATE-2007-KraemerLAM #interactive #parallel #program transformation #source code #using- Interactive presentation: SoftSIMD — exploiting subword parallelism using source code transformations (SK, RL, GA, HM), pp. 1349–1354.
- CIAA-2005-Rytter #fibonacci #graph #word
- The Structure of Subword Graphs and Suffix Trees of Fibonacci Words (WR), pp. 250–261.
- DLT-1999-Cassaigne #complexity
- Subword complexity and periodicity in two or more dimensions (JC), pp. 14–21.
- DLT-1999-Manuch #word
- Characterization of a word by its subwords (JM), pp. 210–219.
- DLT-1995-Cassaigne #complexity #linear #sequence
- Special Factors of Sequences with Linear Subword Complexity (JC), pp. 25–34.
ICALP-1984-BlumerBEHM #automaton #linear #online #set #word- Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time (AB, JB, AE, DH, RMM), pp. 109–118.
