Alexandros Palioudakis
Alexandros Palioudakis
RBC
Verified email at rbc.com - Homepage
TitleCited byYear
State Complexity of Finite Tree Width NFAs.
A Palioudakis, K Salomaa, SG Akl
Journal of Automata, Languages and Combinatorics 17 (2-4), 245-264, 2012
142012
Comparisons between measures of nondeterminism on finite automata
A Palioudakis, K Salomaa, SG Akl
International Workshop on Descriptional Complexity of Formal Systems, 217-228, 2013
132013
State complexity and limited nondeterminism
A Palioudakis, K Salomaa, SG Akl
International Workshop on Descriptional Complexity of Formal Systems, 252-265, 2012
122012
Unary NFAs with limited nondeterminism
A Palioudakis, K Salomaa, SG Akl
International Conference on Current Trends in Theory and Practice of …, 2014
72014
Operational state complexity of unary NFAs with finite nondeterminism
A Palioudakis, K Salomaa, SG Akl
Theoretical Computer Science 610, 108-120, 2016
52016
State complexity of nondeterministic finite automata with limited nondeterminism
A Palioudakis
ProQuest Dissertations Publishing, 2014
52014
Finite nondeterminism vs. dfas with multiple initial states
A Palioudakis, K Salomaa, SG Akl
International Workshop on Descriptional Complexity of Formal Systems, 229-240, 2013
42013
Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form.
A Palioudakis, K Salomaa, SG Akl
International Journal of Unconventional Computing 11, 2015
32015
Quantifying nondeterminism in finite automata
A Palioudakis, K Salomaa, SG Akl
Annals of the University of Bucharest, Informatica, 89-100, 2015
32015
Nondeterministic state complexity of proportional removals
D Goč, A Palioudakis, K Salomaa
International Workshop on Descriptional Complexity of Formal Systems, 102-111, 2013
32013
Worst case branching and other measures of nondeterminism
A Palioudakis, K Salomaa, SG Akl
International Journal of Foundations of Computer Science 28 (03), 195-210, 2017
22017
Duplications and Pseudo-Duplications.
DJ Cho, YS Han, H Kim, A Palioudakis, K Salomaa
International Journal of Unconventional Computing 12, 2016
22016
Lower bound for converting an NFA with finite nondeterminism into an MDFA
A Palioudakis, K Salomaa, SG Akl
Journal of Automata, Languages and Combinatorics 19 (1), 251-264, 2014
22014
State complexity of permutation on finite languages over a binary alphabet
DJ Cho, D Goč, YS Han, SK Ko, A Palioudakis, K Salomaa
Theoretical Computer Science 682, 67-78, 2017
12017
Growth rate of minimum branching
A Palioudakis, YS Han, K Salomaa
Institut fur Informatik, Justus-Liebig Universitat Giessen, 2017
12017
Duplications and pseudo-duplications
DJ Cho, YS Han, H Kim, A Palioudakis, K Salomaa
International Conference on Unconventional Computation and Natural …, 2015
12015
State complexity of unary language operations for NFAs with limited nondeterminism
A Palioudakis, K Salomaa, SG Akl
International Workshop on Descriptional Complexity of Formal Systems, 330-341, 2014
12014
Duplications and Pseudo-Duplications
A Palioudakis, K Salomaa
Unconventional Computation and Natural Computation: 14th International …, 2015
2015
The State Complexity of Permutations on Finite Languages over Binary Alphabets
A Palioudakis, DJ Cho, D Goč, YS Han, SK Ko, K Salomaa
International Workshop on Descriptional Complexity of Formal Systems, 220-230, 2015
2015
Nondeterministic State Complexity and Quantifying Non-Determinism in Finite Automata
A Palioudakis
2012
The system can't perform the operation now. Try again later.
Articles 1–20