Results on homomorphic realization of automata by α0-products

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The notion of an irreducible semigroup has been fundamental to the Krohn-Rhodes decomposition. In this paper we study a similar concept and point out its equivalence with the Krohn-Rhodes irreducibility. We then use the new aspect of irreducible semigroups to provide cascade decompositions of automata in a situation when a strict letter-to-letter replacement is essential. The results are stated in terms of completeness theorems. Our terminology follows Gécseg (1986), so that the cascade composition is referred to as the α0-product.

Original languageEnglish
Pages (from-to)229-249
Number of pages21
JournalTheoretical Computer Science
Volume87
Issue number2
DOIs
Publication statusPublished - Sep 23 1991

Fingerprint

Homomorphic
Cascade
Byproducts
Automata
Semigroup
Decomposition
Decompose
Irreducibility
Terminology
Replacement
Completeness
Equivalence
Chemical analysis
Theorem
Concepts

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Results on homomorphic realization of automata by α0-products. / Ésik, Z.

In: Theoretical Computer Science, Vol. 87, No. 2, 23.09.1991, p. 229-249.

Research output: Contribution to journalArticle

@article{4406e0a4164f48f0a3fe78daf28a0ad1,
title = "Results on homomorphic realization of automata by α0-products",
abstract = "The notion of an irreducible semigroup has been fundamental to the Krohn-Rhodes decomposition. In this paper we study a similar concept and point out its equivalence with the Krohn-Rhodes irreducibility. We then use the new aspect of irreducible semigroups to provide cascade decompositions of automata in a situation when a strict letter-to-letter replacement is essential. The results are stated in terms of completeness theorems. Our terminology follows G{\'e}cseg (1986), so that the cascade composition is referred to as the α0-product.",
author = "Z. {\'E}sik",
year = "1991",
month = "9",
day = "23",
doi = "10.1016/0304-3975(91)90325-V",
language = "English",
volume = "87",
pages = "229--249",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Results on homomorphic realization of automata by α0-products

AU - Ésik, Z.

PY - 1991/9/23

Y1 - 1991/9/23

N2 - The notion of an irreducible semigroup has been fundamental to the Krohn-Rhodes decomposition. In this paper we study a similar concept and point out its equivalence with the Krohn-Rhodes irreducibility. We then use the new aspect of irreducible semigroups to provide cascade decompositions of automata in a situation when a strict letter-to-letter replacement is essential. The results are stated in terms of completeness theorems. Our terminology follows Gécseg (1986), so that the cascade composition is referred to as the α0-product.

AB - The notion of an irreducible semigroup has been fundamental to the Krohn-Rhodes decomposition. In this paper we study a similar concept and point out its equivalence with the Krohn-Rhodes irreducibility. We then use the new aspect of irreducible semigroups to provide cascade decompositions of automata in a situation when a strict letter-to-letter replacement is essential. The results are stated in terms of completeness theorems. Our terminology follows Gécseg (1986), so that the cascade composition is referred to as the α0-product.

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

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

U2 - 10.1016/0304-3975(91)90325-V

DO - 10.1016/0304-3975(91)90325-V

M3 - Article

VL - 87

SP - 229

EP - 249

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 2

ER -