Critical classes for the α0-product

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

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

The Krohn-Rhodes Decomposition Theorem provides two necessary conditions as regards (homomorphic) completeness for the α0-product. We call a class K0 of automata critical if, for every class K, the above necessary conditions and the inclusion K0 ⊆ HSPα0(K) jointly imply that K is complete for the α0-product. We proved that the class K0 consisting of all counters and the two-state reset automation is critical. Here we describe all critical classes.

Original languageEnglish
Pages (from-to)17-24
Number of pages8
JournalTheoretical Computer Science
Volume61
Issue number1
DOIs
Publication statusPublished - 1988

Fingerprint

Automation
Decomposition
Necessary Conditions
Decomposition Theorem
Homomorphic
Automata
Completeness
Inclusion
Imply
Class

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

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

In: Theoretical Computer Science, Vol. 61, No. 1, 1988, p. 17-24.

Research output: Contribution to journalArticle

Dömösi, Pál ; Ésik, Z. / Critical classes for the α0-product. In: Theoretical Computer Science. 1988 ; Vol. 61, No. 1. pp. 17-24.
@article{809583cf06f3440983905d1e29fd78ad,
title = "Critical classes for the α0-product",
abstract = "The Krohn-Rhodes Decomposition Theorem provides two necessary conditions as regards (homomorphic) completeness for the α0-product. We call a class K0 of automata critical if, for every class K, the above necessary conditions and the inclusion K0 ⊆ HSPα0(K) jointly imply that K is complete for the α0-product. We proved that the class K0 consisting of all counters and the two-state reset automation is critical. Here we describe all critical classes.",
author = "P{\'a}l D{\"o}m{\"o}si and Z. {\'E}sik",
year = "1988",
doi = "10.1016/0304-3975(88)90104-1",
language = "English",
volume = "61",
pages = "17--24",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Critical classes for the α0-product

AU - Dömösi, Pál

AU - Ésik, Z.

PY - 1988

Y1 - 1988

N2 - The Krohn-Rhodes Decomposition Theorem provides two necessary conditions as regards (homomorphic) completeness for the α0-product. We call a class K0 of automata critical if, for every class K, the above necessary conditions and the inclusion K0 ⊆ HSPα0(K) jointly imply that K is complete for the α0-product. We proved that the class K0 consisting of all counters and the two-state reset automation is critical. Here we describe all critical classes.

AB - The Krohn-Rhodes Decomposition Theorem provides two necessary conditions as regards (homomorphic) completeness for the α0-product. We call a class K0 of automata critical if, for every class K, the above necessary conditions and the inclusion K0 ⊆ HSPα0(K) jointly imply that K is complete for the α0-product. We proved that the class K0 consisting of all counters and the two-state reset automation is critical. Here we describe all critical classes.

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

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

U2 - 10.1016/0304-3975(88)90104-1

DO - 10.1016/0304-3975(88)90104-1

M3 - Article

VL - 61

SP - 17

EP - 24

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1

ER -