Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Juraj Šebej
Observed name:
Šebej, Juraj
Institution:
University of Pavol Jozef Šafárik
Observed institutions:
University of Pavol Jozef Šafárik,
Slovak Academy of Sciences,
Mathematical Institute of the Slovak Academy of Sciences,
Saint Mary's University
ORCID:
0009-0002-6501-1096
Observed ORCID:
0009-0002-6501-1096
OpenAlex ID:
A5071368648
Reversal of binary regular languages
2012
·
Galina Jirásková
, Juraj Šebej
·
Theoretical Computer Science
·
28
Operations on Unambiguous Finite Automata
2018
·
Jozef Jirásek
, Galina Jirásková
, et al.
·
International Journal of Foundations of Computer Science
·
21
Reversal of regular languages and state complexity.
2010
·
Juraj Šebej
·
ITAT
·
18
Kleene Closure on Regular and Prefix-Free Languages
2014
·
Galina Jirásková
, Matúš Palmovský
, et al.
·
Lecture notes in computer science
·
15
Reversal on Regular Languages and Descriptional Complexity
2013
·
Juraj Šebej
·
Lecture notes in computer science
·
10
Operations on Unambiguous Finite Automata
2016
·
Jozef Jirásek
, Galina Jirásková
, et al.
·
Lecture notes in computer science
·
9
Note on Reversal of Binary Regular Languages
2011
·
Galina Jirásková
, Juraj Šebej
·
Lecture notes in computer science
·
8
Operations on Automata with All States Final
2014
·
Kristína Čevorová
, Galina Jirásková
, et al.
·
Electronic Proceedings in Theoretical Computer Science
·
7
Kuratowski Algebras Generated by Prefix-Free Languages
2016
·
Jozef Jirásek
, Juraj Šebej
·
Lecture notes in computer science
·
4
The Complexity of Languages Resulting from the Concatenation Operation
2016
·
Galina Jirásková
, Alexander Szabari
, et al.
·
Lecture notes in computer science
·
4
Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages
2017
·
Jozef Jirásek
, Matúš Palmovský
, et al.
·
Lecture notes in computer science
·
3
Prefix-free languages: Left and right quotient and reversal
2015
·
Jozef Jirásek
, Galina Jirásková
, et al.
·
Theoretical Computer Science
·
3
PDF
Star-Complement-Star on Prefix-Free Languages
2015
·
Matúš Palmovský
, Juraj Šebej
·
Lecture notes in computer science
·
3
Prefix-Free Subsets of Regular Languages and Descriptional Complexity
2015
·
Jozef Štefan Jirásek
, Juraj Šebej
·
Lecture notes in computer science
·
2
Prefix-Free Languages: Right Quotient and Reversal
2014
·
Jozef Jirásek
, Galina Jirásková
, et al.
·
Lecture notes in computer science
·
2
Operational complexity: NFA-to-DFA trade-off
2025
·
Michal Hospodár
, Jozef Jirásek
, et al.
·
Information and Computation
·
1
Binary Coded Unary Regular Languages
2024
·
Viliam Geffert
, Dominika Pališínová
, et al.
·
International Journal of Foundations of Computer Science
·
1
Decision Problems for Subregular Classes
2024
·
Michal Hospodár
, Viktor Olejár
, et al.
·
Lecture notes in computer science
·
1
On the difference set of two transductions
2024
·
Stavros Konstantinidis
, Nelma Moreira
, et al.
·
Theoretical Computer Science
·
1
PDF
Operational Complexity: NFA-to-DFA Trade-Off
2023
·
Michal Hospodár
, Jozef Jirásek
, et al.
·
Lecture notes in computer science
·
1
Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations
2019
·
Stavros Konstantinidis
, Mitja Mastnak
, et al.
·
Lecture notes in computer science
·
1
PDF
The Complexity of Languages Resulting from the Concatenation Operation
2017
·
Jirásková, Galina
, Szabari, Alexander
, et al.
·
Journal of automata, languages and combinatorics
·
1
Proceedings 17th International Conference on Automata and Formal Languages
2026
·
Hospodár, Michal
, Jirásková, Galina
, et al.
·
Electronic Proceedings in Theoretical Computer Science
Proceedings 17th International Conference on Automata and Formal Languages
2026
·
Michal Hospodár
, Galina Jirásková
, et al.
·
Electronic Proceedings in Theoretical Computer Science
Language membership problems for subregular classes
2026
·
Michal Hospodár
, Viktor Olejár
, et al.
·
Theoretical Computer Science
Show more works
View as search
Works count:
28
Citation count:
144
H-index:
7
I10-index:
5
Year
Topic
Type