State complexity of finite tree width NFAs A Palioudakis, K Salomaa, SG Akl Journal of Automata, Languages and Combinatorics 17 (2), 245-264, 2012 | 26 | 2012 |
Comparisons between measures of nondeterminism on finite automata A Palioudakis, K Salomaa, SG Akl Descriptional Complexity of Formal Systems: 15th International Workshop …, 2013 | 19 | 2013 |
State complexity and limited nondeterminism A Palioudakis, K Salomaa, SG Akl Descriptional Complexity of Formal Systems: 14th International Workshop …, 2012 | 13 | 2012 |
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 | 8 | 2017 |
Unary NFAs with limited nondeterminism A Palioudakis, K Salomaa, SG Akl SOFSEM 2014: Theory and Practice of Computer Science: 40th International …, 2014 | 8 | 2014 |
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 | 7 | 2017 |
Operational state complexity of unary NFAs with finite nondeterminism A Palioudakis, K Salomaa, SG Akl Theoretical Computer Science 610, 108-120, 2016 | 6 | 2016 |
Duplications and pseudo-duplications DJ Cho, YS Han, H Kim, A Palioudakis, K Salomaa Unconventional Computation and Natural Computation: 14th International …, 2015 | 5 | 2015 |
Quantifying nondeterminism in finite automata A Palioudakis, K Salomaa, SG Akl Annals of the University of Bucharest, 89-100, 2015 | 5 | 2015 |
State complexity of nondeterministic finite automata with limited nondeterminism A Palioudakis ProQuest Dissertations Publishing, 2014 | 5 | 2014 |
Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form. A Palioudakis, K Salomaa, SG Akl International Journal of Unconventional Computing 11, 2015 | 4 | 2015 |
Nondeterministic state complexity of proportional removals D GOČ, A Palioudakis, K Salomaa International Journal of Foundations of Computer Science 25 (07), 823-835, 2014 | 4 | 2014 |
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 | 4 | 2013 |
Duplications and Pseudo-Duplications. DJ Cho, YS Han, H Kim, A Palioudakis, K Salomaa International Journal of Unconventional Computing 12, 2016 | 3 | 2016 |
The state complexity of permutations on finite languages over binary alphabets A Palioudakis, DJ Cho, D Goč, YS Han, SK Ko, K Salomaa Descriptional Complexity of Formal Systems: 17th International Workshop …, 2015 | 2 | 2015 |
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 | 2 | 2014 |
Growth rate of minimum branching A Palioudakis, YS Han, K Salomaa Institut fur Informatik, Justus-Liebig Universitat Giessen, 2017 | 1 | 2017 |
State complexity of unary language operations for NFAs with limited nondeterminism A Palioudakis, K Salomaa, SG Akl Descriptional Complexity of Formal Systems: 16th International Workshop …, 2014 | 1 | 2014 |
Nondeterministic state complexity of proportional removals D Goc, A Palioudakis, K Salomaa International Journal of Foundations of Computer Science 25 (7), 823-835, 2014 | | 2014 |
Nondeterministic State Complexity and Quantifying Non-Determinism in Finite Automata A Palioudakis | | 2012 |