Unsolvability of the emptiness problem for alternating 1-way multi-head and multi-tape finite automata over single-letter alphabet

  • Authors:
  • Dainis Geidmanis

  • Affiliations:
  • -

  • Venue:
  • Computers and Artificial Intelligence - Special issue on formal languages, Boolean functions and complexity
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract