Axiomatizing iteration categories

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

We associate an identity with every finite automaton and show that a set of equations consiting of some classical identities as well as the equations associated with a subclass of finite automata is complete for iteration theories if and only if every finite simple group divides the semigroup of an automaton in the given subclass. By taking a special subclass with this property, we arrive at the final result of the paper.

Original languageEnglish
Pages (from-to)65-82
Number of pages18
JournalActa Cybernetica
Volume14
Issue number1
Publication statusPublished - 1999

Fingerprint

Finite Automata
Finite automata
Iteration
Finite Simple Group
Automata
Divides
Semigroup
If and only if

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

Axiomatizing iteration categories. / Ésik, Z.

In: Acta Cybernetica, Vol. 14, No. 1, 1999, p. 65-82.

Research output: Contribution to journalArticle

Ésik, Z 1999, 'Axiomatizing iteration categories', Acta Cybernetica, vol. 14, no. 1, pp. 65-82.
Ésik, Z. / Axiomatizing iteration categories. In: Acta Cybernetica. 1999 ; Vol. 14, No. 1. pp. 65-82.
@article{75df05ef667d47bb88b399258bec56e5,
title = "Axiomatizing iteration categories",
abstract = "We associate an identity with every finite automaton and show that a set of equations consiting of some classical identities as well as the equations associated with a subclass of finite automata is complete for iteration theories if and only if every finite simple group divides the semigroup of an automaton in the given subclass. By taking a special subclass with this property, we arrive at the final result of the paper.",
author = "Z. {\'E}sik",
year = "1999",
language = "English",
volume = "14",
pages = "65--82",
journal = "Acta Cybernetica",
issn = "0324-721X",
publisher = "University of Szeged",
number = "1",

}

TY - JOUR

T1 - Axiomatizing iteration categories

AU - Ésik, Z.

PY - 1999

Y1 - 1999

N2 - We associate an identity with every finite automaton and show that a set of equations consiting of some classical identities as well as the equations associated with a subclass of finite automata is complete for iteration theories if and only if every finite simple group divides the semigroup of an automaton in the given subclass. By taking a special subclass with this property, we arrive at the final result of the paper.

AB - We associate an identity with every finite automaton and show that a set of equations consiting of some classical identities as well as the equations associated with a subclass of finite automata is complete for iteration theories if and only if every finite simple group divides the semigroup of an automaton in the given subclass. By taking a special subclass with this property, we arrive at the final result of the paper.

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

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

M3 - Article

AN - SCOPUS:24244454475

VL - 14

SP - 65

EP - 82

JO - Acta Cybernetica

JF - Acta Cybernetica

SN - 0324-721X

IS - 1

ER -