Galina Jirásková

J. Autom. Lang. Comb., 2023

Operations on Boolean and Alternating Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

Operational Complexity in Subregular Classes.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2023

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

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2023

2022

On linear languages recognized by deterministic biautomata.

[BibT_eX]

[DOI]

Ondrej Klíma

Inf. Comput., 2022

Descriptional Complexity of Formal Systems (DCFS 2019).

[BibT_eX]

[DOI]

Stavros Konstantinidis

Inf. Comput., 2022

2021

Special Issue on Implementation and Application of Automata.

[BibT_eX]

[DOI]

Cezar Câmpeanu

Theor. Comput. Sci., 2021

2020

Preface.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2020

Multiple Concatenation and State Complexity (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2020

2019

State complexity of unambiguous operations on finite automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Nondeterministic complexity in subclasses of convex languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Square on Deterministic, Alternating, and Boolean Finite Automata.

[BibT_eX]

[DOI]

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

Descriptional Complexity of the Forever Operator.

[BibT_eX]

[DOI]

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

Report on CIAA 2018.

[BibT_eX]

[DOI]

Bull. EATCS, 2019

Deterministic Biautomata and Subclasses of Deterministic Linear Languages.

[BibT_eX]

[DOI]

Ondrej Klíma

Proceedings of the Language and Automata Theory and Applications, 2019

NFA-to-DFA Trade-Off for Regular Operations.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018

The complexity of concatenation on deterministic and alternating finite automata.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2018

Operations on Unambiguous Finite Automata.

[BibT_eX]

[DOI]

Jozef Jirásek Jr.

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

The Exact Complexity of Star-Complement-Star.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2018

Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata.

[BibT_eX]

[DOI]

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

State Complexity of Unambiguous Operations on Deterministic Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2018

Operations on Boolean and Alternating Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2018

A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity.

[BibT_eX]

[DOI]

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

The Complexity of Languages Resulting from the Concatenation Operation.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

On the state complexity of operations on two-way finite automata.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Nondeterministic Complexity of Operations on Free and Convex Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2017

Star-complement-star and Kuratowski algebras on prefix-free languages.

[BibT_eX]

Matús Palmovský

Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017

On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

State Complexity of Basic Operations on Non-Returning Regular Languages.

[BibT_eX]

[DOI]

Hae-Sung Eom

Yo-Sub Han

Fundam. Informaticae, 2016

Nondeterministic Complexity of Operations on Closed and Ideal Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2016

Concatenation on deterministic and alternating automata.

[BibT_eX]

Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

Self-Verifying Finite Automata and Descriptional Complexity.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2016

On the State Complexity of the Shuffle of Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015

On the boundary of regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The Boundary of Prefix-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Operations on Self-Verifying Finite Automata.

[BibT_eX]

[DOI]

Jozef Stefan Jirásek

Proceedings of the Computer Science - Theory and Applications, 2015

2014

Quotient Complexity of Closed Languages.

[BibT_eX]

[DOI]

Janusz A. Brzozowski

Chenglong Zou

Theory Comput. Syst., 2014

The Ranges of State Complexities for Complement, Star, and Reversal of Regular Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

On Upper and Lower Bounds on the Length of Alternating Towers.

[BibT_eX]

[DOI]

CoRR, 2014

Operations on Automata with All States Final.

[BibT_eX]

[DOI]

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

Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages.

[BibT_eX]

[DOI]

Acta Cybern., 2014

Kleene Closure on Regular and Prefix-Free Languages.

[BibT_eX]

[DOI]

Matús Palmovský

Proceedings of the Implementation and Application of Automata, 2014

On the Square of Regular Languages.

[BibT_eX]

[DOI]

Kristína Cevorová

Proceedings of the Implementation and Application of Automata, 2014

On Upper and Lower Bounds on the Length of Alternating Towers.

[BibT_eX]

[DOI]

Stepan Holub

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2014

Prefix-Free Languages: Right Quotient and Reversal.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013

Quotient complexity of ideal languages.

[BibT_eX]

[DOI]

Janusz A. Brzozowski

Baiyu Li

Theor. Comput. Sci., 2013

On the State Complexity of the Reverse of R- and J-trivial Regular Languages

[BibT_eX]

[DOI]

CoRR, 2013

Kleene Closure and State Complexity.

[BibT_eX]

[DOI]

Matús Palmovský

Proceedings of the Conference on Information Technologies, 2013

On the State Complexity of the Reverse of - and -Trivial Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2013

Cyclic Shift on Prefix-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2013

2012

Reversal of binary regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On a structural property in the state complexity of projected regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2012

On Union-Free and Deterministic Union-Free Languages.

[BibT_eX]

[DOI]

Benedek Nagy

Proceedings of the Theoretical Computer Science, 2012

On Properties and State Complexity of Deterministic State-Partition Automata.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2012

The State Complexity of Star-Complement-Star.

[BibT_eX]

[DOI]

Jeffrey O. Shallit

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Descriptional Complexity of Biautomata.

[BibT_eX]

[DOI]

Ondrej Klíma

Proceedings of the Descriptional Complexity of Formal Systems, 2012

Descriptional Complexity of Operations on Alternating and Boolean Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2012

2011

Concatenation of Regular Languages and Descriptional Complexity.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Complexity in Union-Free Regular Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Magic Numbers and Ternary Alphabet.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Optimal simulation of self-verifying automata by deterministic automata.

[BibT_eX]

[DOI]

Inf. Comput., 2011

On the State Complexity of Star of Union and Star of Intersection.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Basic Operations on Binary Suffix-Free Languages.

[BibT_eX]

[DOI]

Roland Cmorik

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2011

Note on Reversal of Binary Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

State Complexity of Projected Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010

Nondeterministic State Complexity of Positional Addition.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2010

Complexity in Prefix-Free Regular Languages

[BibT_eX]

[DOI]

Monika Krausová

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages

[BibT_eX]

[DOI]

Janusz A. Brzozowski

Joshua Smith

CoRR, 2010

2009

State Complexity of Intersection and Union of Suffix-Free Languages and Descriptional Complexity.

[BibT_eX]

Pavol Olejár

Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

Converting Self-verifying Automata into Deterministic Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

2008

State complexity of cyclic shift.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2008

Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

On the State Complexity of Complements, Stars, and Reversals of Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2006

Note on the complexity of Las Vegas automata problems.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2006

Deterministic blow-ups of minimal NFA's.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2006

2005

State complexity of some operations on binary regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

State complexity of concatenation and complementation.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Union and Intersection of Regular Languages and Descriptional Complexity.

[BibT_eX]

Marek Hricko

Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004

State Complexity of Concatenation and Complementation of Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2004

The Complexity of Las Vegas Automata Problems.

[BibT_eX]

Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

2003

State Complexity of Some Operations on Regular Languages.

[BibT_eX]

Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

Note on Minimal Automata and Uniform Communication Protocols.

[BibT_eX]

Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2001

Note on Minimal Finite Automata.

[BibT_eX]

[DOI]