Alexandros Palioudakis

Yo-Sub Han

J. Autom. Lang. Comb., 2018

2017

State complexity of permutation on finite languages over a binary alphabet.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Worst Case Branching and Other Measures of Nondeterminism.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2017

2016

Operational state complexity of unary NFAs with finite nondeterminism.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Duplications and Pseudo-Duplications.

[BibT_eX]

[DOI]

Da-Jung Cho

Yo-Sub Han

Hwee Kim

Int. J. Unconv. Comput., 2016

2015

Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2015

The State Complexity of Permutations on Finite Languages over Binary Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014

State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism.

[BibT_eX]

[DOI]

PhD thesis, 2014

Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2014

Nondeterministic State Complexity of Proportional Removals.

[BibT_eX]

[DOI]

Daniel Goc

Int. J. Found. Comput. Sci., 2014

Unary NFAs with Limited Nondeterminism.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013

Finite Nondeterminism vs. DFAs with Multiple Initial States.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2013

Comparisons between Measures of Nondeterminism on Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012

State Complexity of Finite Tree Width NFAs.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2012

State Complexity and Limited Nondeterminism.

[BibT_eX]

[DOI]