scispace - formally typeset
Open AccessJournal ArticleDOI

On the Transformation Semigroups of Finite Automata

TLDR
It is shown that there exists a one-input automaton whose transformation semigroup has its order greater than any polynomial function of the number of states and that the index and the period of the transformation semitecture can be determined in time proportional to thenumber of states.
About
This article is published in Journal of Computer and System Sciences.The article was published on 1983-02-01 and is currently open access. It has received 6 citations till now. The article focuses on the topics: Deterministic automaton & Büchi automaton.

read more

Citations
More filters
Book ChapterDOI

An algebraic characterization of strictly piecewise languages

TL;DR: An algebraic characterization of the Strictly Piecewise class of languages studied by Rogers et al. 2010 is provided, which leads to a procedure which can decide whether a regular language L is Strictially Piecewise in polynomial time in the size of the syntactic monoid for L.
Journal ArticleDOI

Characterization of state-independent automata

TL;DR: The class of all state-independent automata is characterized as a subclass of all semigroup automata (automata generated by semigroups) as well as an automaton over a finite semigroup that is stationary on the right.
Dissertation

Omega algebra model of clinical waste incineration process

Siaw Yee Liew
TL;DR: In this article, the Fuzzy Autocatalytic Set (FACS) is transformed into a semigroup and the transformation semigroup of omega algebra of FACS is constructed.
Journal ArticleDOI

Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of R -strongly connected automata

TL;DR: The class of R -strongly connected automata includes strongly connected, permutation, group type, state-independent and right simple type automata.
References
More filters
Book

The Art of Computer Programming

TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Book

The Design and Analysis of Computer Algorithms

TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Book

The algebraic theory of semigroups

TL;DR: A survey of the structure and representation theory of semi groups is given in this article, along with an extended treatment of the more important recent developments of Semi Group Structure and Representation.
Book

The theory of groups

Marshall Hall
TL;DR: The theory of normal subgroups and homomorphisms was introduced in this article, along with the theory of $p$-groups regular $p-groups and their relation to abelian groups.
Journal ArticleDOI

Finite automata and their decision problems

TL;DR: Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.