Juraj Sebej

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 14

Top Topics

Regular Languages

Expressive Power

Finite Automaton

Top Venues

Int. J. Found. Comput. Sci.

Publications

Michal Hospodár, Jozef Jirásek, Galina Jirásková, Juraj Sebej
Operational Complexity: NFA-to-DFA Trade-Off. DCFS (2023)
Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej
Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem. Int. J. Found. Comput. Sci. 32 (5) (2021)
Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej
Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations. CIAA (2019)
Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej
Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations. CoRR (2019)
Jozef Jirásek Jr., Matús Palmovský, Juraj Sebej
Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation. Int. J. Found. Comput. Sci. 30 (6-7) (2019)
Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej
Operations on Unambiguous Finite Automata. Int. J. Found. Comput. Sci. 29 (5) (2018)
Jozef Jirásek Jr., Matús Palmovský, Juraj Sebej
Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages. DCFS (2017)
Galina Jirásková, Alexander Szabari, Juraj Sebej
The Complexity of Languages Resulting from the Concatenation Operation. J. Autom. Lang. Comb. 22 (1-3) (2017)
Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej
Operations on Unambiguous Finite Automata. DLT (2016)
Galina Jirásková, Alexander Szabari, Juraj Sebej
The Complexity of Languages Resulting from the Concatenation Operation. DCFS (2016)
Jozef Jirásek Jr., Juraj Sebej
Kuratowski Algebras Generated by Prefix-Free Languages. CIAA (2016)
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 (2016)
Matús Palmovský, Juraj Sebej
Star-Complement-Star on Prefix-Free Languages. DCFS (2015)
Jozef Stefan Jirásek, Juraj Sebej
Prefix-Free Subsets of Regular Languages and Descriptional Complexity. DCFS (2015)
Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej
Prefix-Free Languages: Right Quotient and Reversal. DCFS (2014)
Kristína Cevorová, Galina Jirásková, Peter Mlynárcik, Matús Palmovský, Juraj Sebej
Operations on Automata with All States Final. AFL (2014)
Galina Jirásková, Matús Palmovský, Juraj Sebej
Kleene Closure on Regular and Prefix-Free Languages. CIAA (2014)
Juraj Sebej
Reversal on Regular Languages and Descriptional Complexity. DCFS (2013)
Galina Jirásková, Juraj Sebej
Reversal of binary regular languages. Theor. Comput. Sci. 449 (2012)
Galina Jirásková, Juraj Sebej
Note on Reversal of Binary Regular Languages. DCFS (2011)
Juraj Sebej
Reversal of regular languages and state complexity. ITAT (2010)