Juraj Sebej

Orcid: 0009-0002-6501-1096

According to our database1, Juraj Sebej authored at least 18 papers between 2010 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Operational Complexity: NFA-to-DFA Trade-Off.
Proceedings of the Descriptional Complexity of Formal Systems, 2023

2021
Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem.
Int. J. Found. Comput. Sci., 2021

2019
Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation.
Int. J. Found. Comput. Sci., 2019

Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations.
Proceedings of the Implementation and Application of Automata, 2019

2018
Operations on Unambiguous Finite Automata.
Int. J. Found. Comput. Sci., 2018

2017
The Complexity of Languages Resulting from the Concatenation Operation.
J. Autom. Lang. Comb., 2017

Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016
Prefix-free languages: Left and right quotient and reversal.
Theor. Comput. Sci., 2016

Kuratowski Algebras Generated by Prefix-Free Languages.
Proceedings of the Implementation and Application of Automata, 2016

2015
Star-Complement-Star on Prefix-Free Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

Prefix-Free Subsets of Regular Languages and Descriptional Complexity.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014
Operations on Automata with All States Final.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Kleene Closure on Regular and Prefix-Free Languages.
Proceedings of the Implementation and Application of Automata, 2014

Prefix-Free Languages: Right Quotient and Reversal.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013
Reversal on Regular Languages and Descriptional Complexity.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012
Reversal of binary regular languages.
Theor. Comput. Sci., 2012

2011
Note on Reversal of Binary Regular Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010
Reversal of regular languages and state complexity.
Proceedings of the Conference on Theory and Practice of Information Technologies, 2010


  Loading...