COMPLETE CLASSES OF AUTOMATA FOR THE alpha //0-PRODUCT.

Z. Ésik, Pal Domosi

Research output: Contribution to journalArticle

Abstract

A necessary and sufficient condition is given for a class of automata to be (homomorphically) complete for the alpha //0-product. The result is based on the Krohn-Rhodes Decomposition Theorem. The notion of the alpha //0-product essentially coincides with either of the following: loop-free product, series-parallel composition, cascade composition, R-product, quasisuperposition.

Original languageEnglish
Pages (from-to)1-14
Number of pages14
JournalTheoretical Computer Science
Volume47
Issue number1
Publication statusPublished - Dec 1 1986

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this