# Alexandros Palioudakis

According to our database

Collaborative distances:

^{1}, Alexandros Palioudakis authored at least 15 papers between 2012 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Growth Rate of Minimum Branching.

Journal of Automata, Languages and Combinatorics, 2018

2017

State complexity of permutation on finite languages over a binary alphabet.

Theor. Comput. Sci., 2017

Worst Case Branching and Other Measures of Nondeterminism.

Int. J. Found. Comput. Sci., 2017

2016

Operational state complexity of unary NFAs with finite nondeterminism.

Theor. Comput. Sci., 2016

2015

Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form.

IJUC, 2015

Duplications and Pseudo-Duplications.

Proceedings of the Unconventional Computation and Natural Computation, 2015

The State Complexity of Permutations on Finite Languages over Binary Alphabets.

Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014

Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA.

Journal of Automata, Languages and Combinatorics, 2014

Unary NFAs with Limited Nondeterminism.

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism.

Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013

Finite Nondeterminism vs. DFAs with Multiple Initial States.

Proceedings of the Descriptional Complexity of Formal Systems, 2013

Comparisons between Measures of Nondeterminism on Finite Automata.

Proceedings of the Descriptional Complexity of Formal Systems, 2013

Nondeterministic State Complexity of Proportional Removals.

Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012

State Complexity of Finite Tree Width NFAs.

Journal of Automata, Languages and Combinatorics, 2012

State Complexity and Limited Nondeterminism.

Proceedings of the Descriptional Complexity of Formal Systems, 2012