Alexandros Palioudakis

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Growth rate of minimum branching	2018-09-17	Paper
Worst Case Branching and Other Measures of Nondeterminism International Journal of Foundations of Computer Science	2017-06-20	Paper
State complexity of permutation on finite languages over a binary alphabet Theoretical Computer Science	2017-06-15	Paper
Lower bound for converting an NFA with finite nondeterminism into an MDFA	2016-12-16	Paper
Operational state complexity of unary NFAs with finite nondeterminism Theoretical Computer Science	2015-12-10	Paper
Duplications and pseudo-duplications Unconventional Computation and Natural Computation	2015-09-14	Paper
The state complexity of permutations on finite languages over binary alphabets Descriptional Complexity of Formal Systems	2015-08-07	Paper
State complexity of finite tree width NFAs	2015-03-16	Paper
Nondeterministic state complexity of proportional removals International Journal of Foundations of Computer Science	2015-02-09	Paper
Unary NFAs with limited nondeterminism SOFSEM 2014: Theory and Practice of Computer Science	2015-01-13	Paper
State complexity of unary language operations for NFAs with limited nondeterminism Descriptional Complexity of Formal Systems	2014-08-07	Paper
Comparisons between measures of nondeterminism on finite automata Descriptional Complexity of Formal Systems	2013-08-09	Paper
Nondeterministic state complexity of proportional removals Descriptional Complexity of Formal Systems	2013-08-09	Paper
Finite nondeterminism versus DFAs with multiple initial states Descriptional Complexity of Formal Systems	2013-08-09	Paper
State complexity and limited nondeterminism Descriptional Complexity of Formal Systems	2012-11-02	Paper

Research outcomes over time

This page was built for person: Alexandros Palioudakis