| Publication | Date of Publication | Type |
|---|
| Operations on Boolean and Alternating Finite Automata | 2024-04-09 | Paper |
| Operational complexity in subregular classes | 2024-02-28 | Paper |
| A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity | 2023-06-30 | Paper |
| On linear languages recognized by deterministic biautomata | 2022-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994945 | 2021-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964027 | 2021-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146525 | 2021-01-26 | Paper |
| State complexity of unambiguous operations on deterministic finite automata | 2020-06-30 | Paper |
| NFA-to-DFA trade-off for regular operations | 2020-05-12 | Paper |
| Square on Deterministic, Alternating, and Boolean Finite Automata | 2019-12-10 | Paper |
| Deterministic biautomata and subclasses of deterministic linear languages | 2019-12-04 | Paper |
| State complexity of unambiguous operations on finite automata | 2019-11-07 | Paper |
| Nondeterministic complexity in subclasses of convex languages | 2019-08-20 | Paper |
| The complexity of concatenation on deterministic and alternating finite automata | 2019-07-18 | Paper |
| Descriptional Complexity of the Forever Operator | 2019-06-24 | Paper |
| Operations on Boolean and alternating finite automata | 2018-11-28 | Paper |
| Towards exact state complexity bounds for input-driven pushdown automata | 2018-11-22 | Paper |
| Operations on Unambiguous Finite Automata | 2018-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4609330 | 2018-03-29 | Paper |
| Quotient complexity of closed languages | 2017-11-07 | Paper |
| On the descriptive complexity of \(\overline{\varSigma ^*\overline{L}}\) | 2017-10-13 | Paper |
| Square on deterministic, alternating, and Boolean finite automata | 2017-08-31 | Paper |
| Nondeterministic complexity of operations on free and convex languages | 2017-08-22 | Paper |
| On the state complexity of operations on two-way finite automata | 2017-03-16 | Paper |
| State Complexity of Basic Operations on Non-Returning Regular Languages | 2017-03-16 | Paper |
| Self-Verifying Finite Automata and Descriptional Complexity | 2016-11-09 | Paper |
| On the State Complexity of the Shuffle of Regular Languages | 2016-11-09 | Paper |
| The Complexity of Languages Resulting from the Concatenation Operation | 2016-11-09 | Paper |
| Nondeterministic Complexity of Operations on Closed and Ideal Languages | 2016-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2819384 | 2016-09-29 | Paper |
| Operations on Unambiguous Finite Automata | 2016-08-30 | Paper |
| Operations on Self-Verifying Finite Automata | 2015-10-20 | Paper |
| On Upper and Lower Bounds on the Length of Alternating Towers | 2014-10-14 | Paper |
| On the Square of Regular Languages | 2014-09-26 | Paper |
| Kleene Closure on Regular and Prefix-Free Languages | 2014-09-26 | Paper |
| Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages | 2014-08-07 | Paper |
| THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES | 2014-07-04 | Paper |
| State Complexity of Basic Operations on Non-returning Regular Languages | 2013-08-09 | Paper |
| On the State Complexity of the Reverse of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages | 2013-08-09 | Paper |
| Quotient complexity of ideal languages | 2013-02-19 | Paper |
| The State Complexity of Star-Complement-Star | 2012-11-02 | Paper |
| Descriptional Complexity of Biautomata | 2012-11-02 | Paper |
| On Properties and State Complexity of Deterministic State-Partition Automata | 2012-09-21 | Paper |
| On Union-Free and Deterministic Union-Free Languages | 2012-09-21 | Paper |
| On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs | 2012-09-20 | Paper |
| Descriptional Complexity of Operations on Alternating and Boolean Automata | 2012-09-10 | Paper |
| COMPLEXITY IN UNION-FREE REGULAR LANGUAGES | 2012-08-29 | Paper |
| Reversal of binary regular languages | 2012-08-13 | Paper |
| On a structural property in the state complexity of projected regular languages | 2012-08-13 | Paper |
| On the State Complexity of Star of Union and Star of Intersection | 2012-07-04 | Paper |
| Concatenation of regular languages and descriptional complexity | 2011-10-11 | Paper |
| State Complexity of Projected Languages | 2011-07-29 | Paper |
| Note on Reversal of Binary Regular Languages | 2011-07-29 | Paper |
| Optimal simulation of self-verifying automata by deterministic automata | 2011-07-27 | Paper |
| MAGIC NUMBERS AND TERNARY ALPHABET | 2011-03-30 | Paper |
| Complexity in Union-Free Regular Languages | 2010-08-31 | Paper |
| Quotient complexity of closed languages | 2010-06-22 | Paper |
| Quotient Complexity of Ideal Languages | 2010-04-27 | Paper |
| Concatenation of Regular Languages and Descriptional Complexity | 2009-08-18 | Paper |
| Magic Numbers and Ternary Alphabet | 2009-07-07 | Paper |
| Converting Self-verifying Automata into Deterministic Automata | 2009-04-02 | Paper |
| On the State Complexity of Complements, Stars, and Reversals of Regular Languages | 2008-10-30 | Paper |
| On the State Complexity of Operations on Two-Way Finite Automata | 2008-10-30 | Paper |
| State complexity of cyclic shift | 2008-07-29 | Paper |
| Deterministic blow-ups of minimal NFA's | 2007-02-08 | Paper |
| Note on the complexity of Las Vegas automata problems | 2007-02-08 | Paper |
| State complexity of some operations on binary regular languages | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453205 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779161 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204430 | 1991-01-01 | Paper |
