Growth rate of minimum branching

Alexandros Palioudakis, Yo Sub Han, Kai Salomaa

Research output: Contribution to journalArticle


There are different ways of quantifying the nondeterminism used by a nondeterministic finite automaton (NFA). The amount of nondeterminism is measured as a function of the input length. For most nondeterminism measures the possible growth rates of the measure have been characterized, but this question remains open for the branching of an NFA. Here, we consider a close variant of the branching measure which we call the minimum branching. We show that the minimum branching of an NFA is always either bounded or grows exponentially.

Original languageEnglish
Pages (from-to)281-292
Number of pages12
JournalJournal of Automata, Languages and Combinatorics
Issue number1-3
Publication statusPublished - 2018 Jan 1

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Growth rate of minimum branching'. Together they form a unique fingerprint.

  • Cite this