eCommons

 

On the Semigroup of Strongly Connected Automata

Other Titles

Abstract

In 1964 Weeg [6] has posed a question asking which semi-groups admit strongly connected automata. The presumed answer was given in 1971 by Oehmke [5] through the following statement: A semigroup admits strongly connected automaton if it has a homomorphic image either a nontrivial finite group or semigroup of the transformations of some right zero semigroup. This theorem can be reformulated as follows: A semigroup is a characteristic semigroup of strongly connected automaton if it has a homomorphic image either a nontrivial finite group or a semigroup of transformations of some right zero semigroup. In this paper the "only if" part of this theorem has been overthrown. Some related problems concerning strongly connectedness of finite automata are also investigated. Key Words and Phrases: semigroup, characteristic semigroup of an automaton, strongly connected automaton.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1977-02

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR77-302

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record