Alexandros Palioudakis

18 papers B 1Journal 9Unranked 7
YearRankTypeTitle / Venue / Authors
2018 J jnl
Growth Rate of Minimum Branching.
J. Autom. Lang. Comb.
Alexandros Palioudakis, Yo-Sub Han, Kai Salomaa
2017 J jnl
State complexity of permutation on finite languages over a binary alphabet.
Theor. Comput. Sci.
Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Alexandros Palioudakis, Kai Salomaa
2017 J jnl
Worst Case Branching and Other Measures of Nondeterminism.
Int. J. Found. Comput. Sci.
Alexandros Palioudakis, Kai Salomaa, Selim G. Akl
2016 J jnl
Duplications and Pseudo-Duplications.
Int. J. Unconv. Comput.
Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa
2016 J jnl
Operational state complexity of unary NFAs with finite nondeterminism.
Theor. Comput. Sci.
Alexandros Palioudakis, Kai Salomaa, Selim G. Akl
2015 — conf
Duplications and Pseudo-Duplications.
UCNC
Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa
2015 — conf
The State Complexity of Permutations on Finite Languages over Binary Alphabets.
DCFS
Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa
2015 J jnl
Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form.
Int. J. Unconv. Comput.
Alexandros Palioudakis, Kai Salomaa, Selim G. Akl
2014 J jnl
Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA.
J. Autom. Lang. Comb.
Alexandros Palioudakis, Kai Salomaa, Selim G. Akl
2014 J jnl
Nondeterministic State Complexity of Proportional Removals.
Int. J. Found. Comput. Sci.
Daniel Goc, Alexandros Palioudakis, Kai Salomaa
2014 — —
State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism.
Alexandros Palioudakis
2014 — conf
State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism.
DCFS
Alexandros Palioudakis, Kai Salomaa, Selim G. Akl
2014 B conf
Unary NFAs with Limited Nondeterminism.
SOFSEM
Alexandros Palioudakis, Kai Salomaa, Selim G. Akl
2013 — conf
Comparisons between Measures of Nondeterminism on Finite Automata.
DCFS
Alexandros Palioudakis, Kai Salomaa, Selim G. Akl
2013 — conf
Finite Nondeterminism vs. DFAs with Multiple Initial States.
DCFS
Alexandros Palioudakis, Kai Salomaa, Selim G. Akl
2013 — conf
Nondeterministic State Complexity of Proportional Removals.
DCFS
Daniel Goc, Alexandros Palioudakis, Kai Salomaa
2012 — conf
State Complexity and Limited Nondeterminism.
DCFS
Alexandros Palioudakis, Kai Salomaa, Selim G. Akl
2012 J jnl
State Complexity of Finite Tree Width NFAs.
J. Autom. Lang. Comb.
Alexandros Palioudakis, Kai Salomaa, Selim G. Akl