ČESKÉ VYSOKÉ UČENÍ TECHNICKÉ V PRAZE
STUDIJNÍ PLÁNY
2019/2020

# Automata in Text Pattern Matching

Kód Zakončení Kredity Rozsah Jazyk výuky
MIE-AVY Z,ZK 4 2P+1C
Přednášející:
Ondřej Guth (gar.), Bořivoj Melichar (gar.)
Cvičící:
Ondřej Guth (gar.)
Předmět zajišťuje:
katedra teoretické informatiky
Anotace:

Students learn algorithms for searching in texts using finite automata and in trees using tree automata. They become acquainted with the searching problems taxonomy and learn the principles of automata constructions for solving these problems. They will be able to apply the gained knowledge in the design of applications required text pattern matching (such as data streaming, DNA sequencing, etc.) and in trees.

Basics of formal language theory and finite automata.

Osnova přednášek:

1. Finite automata, basic operations with finite automata. Taxonomy of pattern matching problems for exact and approximate matching. Forward pattern matching, models of searching algorithms. Nondeterministic search automata.

2. Simulation of nondeterministic search automata, bit parallelism, dynamic programming.

3. Deterministic search finite automata and their complexity.

4. Construction of prefix and suffix automata. Construction of factor automata, factor and suffix oracles. Computation of borders and periods of text. Searching exact and approximate repetitions in text.

5. Searching other string regularities and other indexing automata applications.

6. Finite automata and generalised strings: indexing, regularities.

7. Backward pattern matching.

8. Classes of deterministic and nondeterministic pushdown automata. Determinisation of pushdown automata.

9. Tree automata.

10. Tree pattern matching &amp; indexing, non-linear tree patterns.

11. Tree regular expressions.

Osnova cvičení:
Cíle studia:

The module deals with automata models of algorithms for text and tree searching. The main topics are text pattern matching and repetitions. In both cases, both exact and inexact pattern matchings are considered. The fundamental formal tools for description of the algorithms are the finite automaton for text searching and tree automaton for tree searching. The knowledge gained in this module can be applied in analysis and design of algorithms for text and tree pattern matching.

Studijní materiály:

1. Melichar, B., Holub, J., Polcar, T. ''Text searching algorithms''. Volume I and II, Lecture notes. Prague, CTU, 2008.

2. Melichar, B., et al. ''Text searching algorithms''. Seminars. Prague, CTU, 2008.

Poznámka:
Další informace:
https://courses.fit.cvut.cz/MIE-AVY
Rozvrh na zimní semestr 2019/2020:
Rozvrh není připraven
Rozvrh na letní semestr 2019/2020:
Rozvrh není připraven
Předmět je součástí následujících studijních plánů:
Platnost dat k 28. 1. 2020
Aktualizace výše uvedených informací naleznete na adrese http://bilakniha.cvut.cz/cs/predmet1438606.html