Members

	Miroslav Balík Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: Miroslav.BalikᏍfit.cvut.cz phone: (+420) 224 359 874 Papers on our conference 1998: Implementation of DAWG 2000: Condensation Principle
☹	Dominika Draesslerová Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: draesdomᏍfit.cvut.cz
	Eliška Šestáková Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: eliska.sestakovaᏍfit.cvut.cz phone: Papers on our conference 2018: Constrained Approximate Subtree Matching by Finite Automata 2021: Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance
	Ondřej Guth Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: ondrej.guthᏍfit.cvut.cz phone: Papers on our conference 2016: Computing All Approximate Enhanced Covers with the Hamming Distance 2021: Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance 2023: On Expressive Power of Regular Expressions with Subroutine Calls and Lookaround Assertions
	Jan Holub Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: Jan.HolubᏍfit.cvut.cz WWW: www.stringology.org/~holub/ phone: (+420) 224 357 814 Papers on our conference 1996: Reduced Nondeterministic Finite Automata for Approximate String Matching 1997: 6D Classification of Pattern Matching Problems 1997: Simulation of NFA in Approximate String and Sequence Matching 1998: Dynamic Programming for Reduced NFAs for Approximate String and Sequence Matching
	Jan Janoušek Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: Jan.JanousekᏍfit.cvut.cz WWW: users.fit.cvut.cz/~janousej/ phone: (+420) 224 359 872 Papers on our conference 2009: String Suffix Automata and Subtree Pushdown Automata 2018: Constrained Approximate Subtree Matching by Finite Automata 2020: Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination 2020: Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array 2021: Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance
☹	Josef Erik Sedláček Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: sedlajo5Ꮝfit.cvut.cz
	Jan Lahoda Oracle U Trezorky 921/2 158 00 Praha 5	E-mail: Jan.LahodaᏍseznam.cz Papers on our conference 2005: General Pattern Matching on Regular Collage System 2010: Simple Tree Pattern Matching for Trees in the Prefix Bar Notation
	Petr Matyáš Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: matyape1Ꮝfit.cvut.cz phone:
	Bořivoj Melichar Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: melicharᏍfit.cvut.cz phone: (+420) 224 357 287, (+420) 224 359 872 Papers on our conference 1996: Space Complexity of Linear Time Approximate String Matching 1997: 6D Classification of Pattern Matching Problems 1998: Directed Acyclic Subsequence Graph 2003: Operation L-INSERT on Factor Automaton 2004: Arithmetic Coding in Parallel 2005: General Pattern Matching on Regular Collage System 2005: Backward Pattern Matching Automaton 2006: 2D Bitwise Memory Matrix: A Tool for Optimal Parallel Approximate Pattern Matching 2013: Graphs and Automata 2018: Constrained Approximate Subtree Matching by Finite Automata
	Radomír Polách Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: polacradᏍfit.cvut.cz phone:
	Martin Poliak Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: martin.poliakᏍcentrum.cz phone:
	Petr Procházka Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: petr.prochᏍseznam.cz phone:
☹	Robin Obůrka Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: oburkrobᏍfit.cvut.cz Papers on our conference 2020: Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array
	Štěpán Plachý Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: stepan.plachyᏍfit.cvut.cz
☹	Tomáš Pecka Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: peckato1Ꮝfit.cvut.cz Papers on our conference 2020: Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination 2020: Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array
	Jan Trávníček Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: Jan.TravnicekᏍfit.cvut.cz phone: +420 224 359 882 Papers on our conference 2020: Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination 2020: Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array
	Ladislav Vagner Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: Ladislav.VagnerᏍfit.cvut.cz WWW: progtest.fit.cvut.cz phone: (+420) 224 359 874
	Jan Žďárek Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: Jan.ZdarekᏍfit.cvut.cz phone: (+420) 224 357 632, (+420) 224 359 874 Papers on our conference 2010: Simple Tree Pattern Matching for Trees in the Prefix Bar Notation