Finite-State Sequence Recognition is a method within sequence pattern recognition that identifies and classifies sequences based on transitions among a finite set of states, typically modeled by finite automata or state machines.
22
Publications
1.4K
Citations
50
Authors
21
Institutions
Publications per year
2017–2026
1
Parents
Publications
22
An algorithm for connected word recognition
Jon R. Bridle, Marcel G. Brown, Richard Chamberlain · 2005 · 93 citations
1–5 of 22
Authors
50
- EW
2
h-index
- DA
2
h-index
- AC
2
h-index
- DS
2
h-index
- JL
2
h-index
1–5 of 50
Institutions
21
Carnegie Mellon University
Pittsburgh, United States
3 h-index
7 publications
1.9K citations
University of Ottawa
Ottawa, Canada
2 h-index
2 publications
201 citations
University of Guelph
Guelph, Canada
2 h-index
4 publications
70 citations
University of Cambridge
Cambridge, United Kingdom
1 h-index
1 publications
14 citations
Concordia University
Montreal, Canada
1 h-index
1 publications
24 citations
Brunel University of London
London, United Kingdom
1 h-index
1 publications
86 citations
Technical University of Munich
Munich, Germany
1 h-index
4 publications
56 citations
University of California, Berkeley
Berkeley, United States
1 h-index
2 publications
24 citations
1–8 of 21
Venues
- Pattern Recognition
2 publications · 63 citations
2
h-index
- IEEE Transactions on Computers
2 publications · 201 citations
2
h-index
- Neural Computation
1 publications · 462 citations
1
h-index
- University of Groningen research database (University of Groningen / Centre for Information Technology)
Repository · 1 publications · 124 citations
1
h-index
- Pattern Recognition and Image Analysis
1 publications · 10 citations
1
h-index
1–5