Jozef Jirásek

According to our database, Jozef Jirásek authored at least 13 papers between 2010 and 2025.

Collaborative distances:

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

2025

Store Languages of Turing Machines and Counter Machines.

Noah Friesen, Oscar H. Ibarra, Jozef Jirásek, Ian McQuillan

CoRR, September, 2025

2022

Visit-Bounded Stack Automata.

Jozef Jirásek, Ian McQuillan

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2020

Space Complexity of Stack Automata Models.

Oscar H. Ibarra, Jozef Jirásek Jr., Ian McQuillan, Luca Prigioniero

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

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

2018

Computational Complexity of Decision Problems on Self-verifying Finite Automata.

Markus Holzer, Sebastian Jakobi, Jozef Jirásek Jr.

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

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

Kuratowski Algebras Generated by Prefix-Free Languages.

Jozef Jirásek Jr., Juraj Sebej

Proceedings of the Implementation and Application of Automata, 2016

Operations on Unambiguous Finite Automata.

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

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

Non-regular Maximal Prefix-Free Subsets of Regular Languages.

Jozef Jirásek Jr.

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

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

Operations on Self-Verifying Finite Automata.

Jozef Stefan Jirásek, Galina Jirásková, Alexander Szabari

Proceedings of the Computer Science - Theory and Applications, 2015

2011

On the Complexity of Planar Covering of Small Graphs.

Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2010

Structural and Complexity Aspects of Line Systems of Graphs.

Jozef Jirásek, Pavel Klavík

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010