Author:
Bc. Šimon Huraj
Thesis supervisor:
RNDr. Juraj Šebej, PhD.
Bc. Šimon Huraj
RNDr. Juraj Šebej, PhD.
Markus Holzer, Kai Salomaa, Sheng Yu: On the State Complexity of k-Entry Deterministic Finite Automata. J. Autom. Lang. Comb. 6(4): 453-466 (2001)
John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to automata theory, languages, and computation - international edition (2. ed). Addison-Wesley (2003)
Jacques Sakarovitch: Elements of Automata Theory. Cambridge University Press 2009, ISBN 978-0-521-84425-3, pp. I-XXIV, 1-758 (2009)
M. Krausová, Prefix-free regular languages: closure properties, difference, and left quotient, in: Z. Kotásek, et al. (Eds.), Proc. MEMICS 2011, in: LNCS, vol.7119, Springer, Heidelberg, 2012, pp.114–122.
Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej: Prefix-free languages: Left and right quotient and reversal. Theor. Comput. Sci. 610: 78-90 (2016)