The Average Transition Complexity of Glushkov and Partial Derivative Automata

  • Sabine Broda
  • António Machiavelo
  • Nelma Moreira
  • Rogério Reis
Conference paper

DOI: 10.1007/978-3-642-22321-1_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6795)
Cite this paper as:
Broda S., Machiavelo A., Moreira N., Reis R. (2011) The Average Transition Complexity of Glushkov and Partial Derivative Automata. In: Mauri G., Leporati A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg

Abstract

In this paper, the relation between the Glushkov automaton (\(\mathcal{A}_{\mathrm{pos}}\)) and the partial derivative automaton (\(\mathcal{A}_{\mathrm{pd}}\)) of a given regular expression, in terms of transition complexity, is studied. The average transition complexity of \(\mathcal{A}_{\mathrm{pos}}\) was proved by Nicaud to be linear in the size of the corresponding expression. This result was obtained using an upper bound of the number of transitions of \(\mathcal{A}_{\mathrm{pos}}\). Here we present a new quadratic construction of \(\mathcal{A}_{\mathrm{pos}}\) that leads to a more elegant and straightforward implementation, and that allows the exact counting of the number of transitions. Based on that, a better estimation of the average size is presented. Asymptotically, and as the alphabet size grows, the number of transitions per state is on average 2.

Broda et al. computed an upper bound for the ratio of the number of states of \(\mathcal{A}_{\mathrm{pd}}\) to the number of states of \(\mathcal{A}_{\mathrm{pos}}\), which is about \(\frac{1}{2}\) for large alphabet sizes. Here we show how to obtain an upper bound for the number of transitions in \(\mathcal{A}_{\mathrm{pd}}\), which we then use to get an average case approximation. Some experimental results are presented that illustrate the quality of our estimate.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Sabine Broda
    • 1
  • António Machiavelo
    • 1
  • Nelma Moreira
    • 1
  • Rogério Reis
    • 1
  1. 1.CMUP, Faculdade de Ciências da Universidade do PortoPortoPortugal

Personalised recommendations