Complete classes of automata for the α0-product

Z. Ésik, Pál Dömösi

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

A necessary and sufficient condition is given for a class of automata to be (homomorphically) complete for the α0-product. The result is based on the Krohn-Rhodes Decomposition Theorem. The notion of the α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 numberC
DOIs
Publication statusPublished - 1986

Fingerprint

Automata
Chemical analysis
Parallel Composition
Free Product
Decomposition Theorem
Decomposition
Cascade
Necessary Conditions
Series
Sufficient Conditions
Class

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Complete classes of automata for the α0-product. / Ésik, Z.; Dömösi, Pál.

In: Theoretical Computer Science, Vol. 47, No. C, 1986, p. 1-14.

Research output: Contribution to journalArticle

Ésik, Z. ; Dömösi, Pál. / Complete classes of automata for the α0-product. In: Theoretical Computer Science. 1986 ; Vol. 47, No. C. pp. 1-14.
@article{ec25214e5a74414fb6e0670202fe6ea4,
title = "Complete classes of automata for the α0-product",
abstract = "A necessary and sufficient condition is given for a class of automata to be (homomorphically) complete for the α0-product. The result is based on the Krohn-Rhodes Decomposition Theorem. The notion of the α0-product essentially coincides with either of the following: loop-free product, series-parallel composition, cascade composition, R-product, quasisuperposition.",
author = "Z. {\'E}sik and P{\'a}l D{\"o}m{\"o}si",
year = "1986",
doi = "10.1016/0304-3975(86)90129-5",
language = "English",
volume = "47",
pages = "1--14",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - Complete classes of automata for the α0-product

AU - Ésik, Z.

AU - Dömösi, Pál

PY - 1986

Y1 - 1986

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

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

UR - http://www.scopus.com/inward/record.url?scp=0022902121&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022902121&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(86)90129-5

DO - 10.1016/0304-3975(86)90129-5

M3 - Article

AN - SCOPUS:0022902121

VL - 47

SP - 1

EP - 14

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - C

ER -