Back to Results
First PageMeta Content
Theoretical computer science / Mathematics / Coding theory / Discrete mathematics / Nondeterministic finite automaton / Levenshtein distance / Hamming distance / String / Finite state transducer / Automata theory / Formal languages / Models of computation


IAENG International Journal of Computer Science, 36:2, IJCS_36_2_05 ______________________________________________________________________________________ Finite Automata Approach to Computing All Seeds of Strings with t
Add to Reading List

Document Date: 2009-05-20 16:44:06

Open Document

File Size: 412,60 KB

Share Result on Facebook

City

Springer / London / /

Company

AMD / /

Country

United Kingdom / Czech Republic / /

/

Facility

Czech Technical University / University of Salerno / /

IndustryTerm

e-times / depthfirst search / space algorithm / online publication / breadth-first search / text processing / rst algorithm / /

OperatingSystem

Gentoo Linux / GNU / /

Organization

Czech Technical University in Prague / Faculty of Electrical Engineering / Czech Science Foundation / Ministry of Education / Department of Computer Science and Engineering / University of Salerno / /

/

ProgrammingLanguage

D / R / T / C++ / /

ProvinceOrState

MSkN / MSkD / New York / QN / /

Technology

rst algorithm / Text Searching Algorithms / Information Technologies / 2 using Algorithm / Linux / The algorithm / using Algorithm / presented algorithm / /

URL

http /

SocialTag