Alexandros Palioudakis
Alexandros Palioudakis
Goldman Sachs
Verified email at gs.com - Homepage
Title
Cited by
Cited by
Year
State complexity of finite tree width NFAs
A Palioudakis, K Salomaa, SG Akl
Journal of Automata, Languages and Combinatorics 17 (2), 245-264, 2012
172012
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
142013
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
62016
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
52017
State complexity of nondeterministic finite automata with limited nondeterminism
A Palioudakis
52014
Quantifying nondeterminism in finite automata
A Palioudakis, K Salomaa, SG Akl
Annals of the University of Bucharest, Informatica, 89-100, 2015
42015
Nondeterministic state complexity of proportional removals
D Goč, A Palioudakis, K Salomaa
International Workshop on Descriptional Complexity of Formal Systems, 102-111, 2013
42013
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
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
32017
Duplications and Pseudo-Duplications.
DJ Cho, YS Han, H Kim, A Palioudakis, K Salomaa
International Journal of Unconventional Computing 12, 2016
32016
Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form.
A Palioudakis, K Salomaa, SG Akl
International Journal of Unconventional Computing 11, 2015
32015
Duplications and pseudo-duplications
DJ Cho, YS Han, H Kim, A Palioudakis, K Salomaa
International Conference on Unconventional Computation and Natural …, 2015
32015
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
32015
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
Growth rate of minimum branching
A Palioudakis, YS Han, K Salomaa
Institut fur Informatik, Justus-Liebig Universitat Giessen, 2017
12017
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
Nondeterministic State Complexity and Quantifying Non-Determinism in Finite Automata
A Palioudakis
2012
Conjunctive and Boolean Grammars
A Palioudakis
The system can't perform the operation now. Try again later.
Articles 1–20