Subsequence Closure is a formal property of a language class in automata theory whereby a language exhibits closure under the formation of subsequences, meaning that every subsequence of any string in the language is also contained within the language.
16
Publications
602
Citations
34
Authors
24
Institutions
Publications per year
2017–2026
2
Parents
Publications
16
Spaces in which sequences suffice II
S. Franklin · Fundamenta Mathematicae · 1967 · 101 citations · Full text
Algorithms for subsequence combinatorics
Cees H. Elzinga, Sven Rahmann, Hui Wang · Theoretical Computer Science · 2008 · 79 citations · Full text
More on Generalized Automatic Sequences
Michel Rigo, Arnaud Maes · ORBi (University of Liège) · 2002 · 57 citations · Full text
Efficiently Mining Closed Subsequences with Gap Constraints
Li Chun, Jianyong Wang · 2008 · 49 citations
1–5 of 16
Authors
34
- WG
2
h-index
- EP
1
h-index
- CH
1
h-index
- LV
1
h-index
- HP
1
h-index
1–5 of 34
Institutions
24
Oranim Academic College of Education
Haifa, Israel
1 h-index
1 publications
10 citations
Hungarian Academy of Sciences
Budapest, Hungary
1 h-index
1 publications
26 citations
University of Ulster
Coleraine, United Kingdom
1 h-index
1 publications
79 citations
Tianjin University
Tianjin, China
1 h-index
1 publications
14 citations
Yale University
New Haven, United States
1 h-index
2 publications
62 citations
University of Mons
Mons, Belgium
1 h-index
1 publications
57 citations
University of Saskatchewan
Saskatoon, Canada
1 h-index
2 publications
62 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
1 h-index
1 publications
25 citations
1–8 of 24
Venues
- Bulletin of the London Mathematical Society
1 publications · 11 citations
1
h-index
- Probability Theory and Related Fields
1 publications · 26 citations
1
h-index
- Israel Journal of Mathematics
1 publications · 31 citations
1
h-index
- Theoretical Computer Science
1 publications · 79 citations
1
h-index
- Acta Arithmetica
1 publications · 14 citations
1
h-index
1–5