Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata

  • Authors:

  • Giovanna J. Lavado;Giovanni Pighizzini;Shinnosuke Seki

  • Affiliations:

  • Dipartimento di Informatica, Universití degli Studi di Milano, Italy;Dipartimento di Informatica, Universití degli Studi di Milano, Italy;Department of Information and Computer Science, Aalto University, Finland and Helsinki Institute of Information Technology, Finland

  • Venue:
  • Information and Computation
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate the conversion of one-way nondeterministic finite automata and context-free grammars into Parikh equivalent one-way and two-way deterministic finite automata, from a descriptional complexity point of view. We prove that for each one-way nondeterministic automaton with n states there exist Parikh equivalent one-way and two-way deterministic automata with e^O^(^n^@?^l^n^n^) and p(n) states, respectively, where p(n) is a polynomial. Furthermore, these costs are tight. In contrast, if all the words accepted by the given automaton contain at least two different letters, then a Parikh equivalent one-way deterministic automaton with a polynomial number of states can be found. Concerning context-free grammars, we prove that for each grammar in Chomsky normal form with h variables there exist Parikh equivalent one-way and two-way deterministic automata with 2^O^(^h^^^2^) and 2^O^(^h^) states, respectively. Even these bounds are tight.