Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata

@article{Sawa2013EfficientCO,
  title={Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata},
  author={Zdenek Sawa},
  journal={Fundam. Inform.},
  year={2013},
  volume={123},
  pages={97-106}
}
In languages over a unary alphabet, i.e., an alphabet with only one letter, words can be identified with their lengths. It is well known that each regular language over a unary alphabet can be represented as the union of a finite number of arithmetic progressions. Given a nondeterministic finite automaton (NFA) working over a unary alphabet (a unary NFA), the arithmetic progressions representing the language accepted by the automaton can be easily computed by the determinization of the given… CONTINUE READING
5 Citations
11 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Efficient Computation of Regular Expressions from Unary NFAs

  • A. Martinez
  • Descriptional Complexity of Formal Systems (DFCS…
  • 2002
Highly Influential
5 Excerpts

Topics in Formal Languages: String Enumeration, Unary NFAs and State Complexity

  • A. Martinez
  • Master Thesis,
  • 2002
Highly Influential
5 Excerpts

On the Computational Complexity of Verifying One-Counter Processes, LICS’09

  • S. Göller, R. Mayr, A. W. To
  • IEEE Computer Society,
  • 2009
1 Excerpt

Similar Papers

Loading similar papers…