Jozef Jirásek

Orcid: 0000-0003-4822-230X

Affiliations:
  • P.J. Šafárik University, Košice, Slovakia


According to our database1, Jozef Jirásek authored at least 17 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
State Complexity of the Minimal Star Basis.
Proceedings of the Implementation and Application of Automata, 2024

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

2020
Multiple Concatenation and State Complexity (Extended Abstract).
Proceedings of the Descriptional Complexity of Formal Systems, 2020

2018
The Exact Complexity of Star-Complement-Star.
Proceedings of the Implementation and Application of Automata, 2018

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

2015
On the boundary of regular languages.
Theor. Comput. Sci., 2015

The Boundary of Prefix-Free Languages.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

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

2013
Cyclic Shift on Prefix-Free Languages.
Proceedings of the Computer Science - Theory and Applications, 2013

2009
User Preference Web Search -- Experiments with a System Connecting Web and User.
Comput. Informatics, 2009

2008
Knowledge Processing for Web Search - An Integrated Model and Experiments.
Scalable Comput. Pract. Exp., 2008

Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet.
Int. J. Found. Comput. Sci., 2008

2007
Knowledge Processing for Web Search - An Integrated Model.
Proceedings of the Advances in Intelligent and Distributed Computing, 2007

2005
Arc reversal in nonhamiltonian circulant oriented graphs.
J. Graph Theory, 2005

State complexity of concatenation and complementation.
Int. J. Found. Comput. Sci., 2005

2004
State Complexity of Concatenation and Complementation of Regular Languages.
Proceedings of the Implementation and Application of Automata, 2004

1992
Some remarks on Ádám's conjecture for simple directed graphs.
Discret. Math., 1992


  Loading...