Juraj Sebej

According to our database, Juraj Sebej authored at least 20 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

On the difference set of two transductions.

Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Juraj Sebej

Theor. Comput. Sci., 2024

Decision Problems for Subregular Classes.

Michal Hospodár, Viktor Olejár, Juraj Sebej

Proceedings of the Implementation and Application of Automata, 2024

2023

Operational Complexity: NFA-to-DFA Trade-Off.

Michal Hospodár, Jozef Jirásek, Galina Jirásková, Juraj Sebej

Proceedings of the Descriptional Complexity of Formal Systems, 2023

2021

Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem.

Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej

Int. J. Found. Comput. Sci., 2021

2019

Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation.

Jozef Jirásek Jr., Matús Palmovský, Juraj Sebej

Int. J. Found. Comput. Sci., 2019

Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations.

Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej

Proceedings of the Implementation and Application of Automata, 2019

2018

Operations on Unambiguous Finite Automata.

Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej

Int. J. Found. Comput. Sci., 2018

2017

The Complexity of Languages Resulting from the Concatenation Operation.

Galina Jirásková, Alexander Szabari, Juraj Sebej

J. Autom. Lang. Comb., 2017

Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages.

Jozef Jirásek Jr., Matús Palmovský, Juraj Sebej

Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016

Prefix-free languages: Left and right quotient and reversal.

Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej

Theor. Comput. Sci., 2016

Kuratowski Algebras Generated by Prefix-Free Languages.

Jozef Jirásek Jr., Juraj Sebej

Proceedings of the Implementation and Application of Automata, 2016

2015

Star-Complement-Star on Prefix-Free Languages.

Matús Palmovský, Juraj Sebej

Proceedings of the Descriptional Complexity of Formal Systems, 2015

Prefix-Free Subsets of Regular Languages and Descriptional Complexity.

Jozef Stefan Jirásek, Juraj Sebej

Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014

Operations on Automata with All States Final.

Kristína Cevorová, Galina Jirásková, Peter Mlynárcik, Matús Palmovský, Juraj Sebej

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Kleene Closure on Regular and Prefix-Free Languages.

Galina Jirásková, Matús Palmovský, Juraj Sebej

Proceedings of the Implementation and Application of Automata, 2014

Prefix-Free Languages: Right Quotient and Reversal.

Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej

Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013

Reversal on Regular Languages and Descriptional Complexity.

Juraj Sebej

Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012

Reversal of binary regular languages.

Galina Jirásková, Juraj Sebej

Theor. Comput. Sci., 2012

2011

Note on Reversal of Binary Regular Languages.

Galina Jirásková, Juraj Sebej

Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010

Reversal of regular languages and state complexity.

Juraj Sebej

Proceedings of the Conference on Theory and Practice of Information Technologies, 2010