Open AccessBook
Algebraic automata theory
Reads0
Chats0
TLDR
In this paper, the holonomy decomposition is used to decompose semigroups and their relatives into machines and semiggroups, and their relation to semigroup decompositions.Abstract:
Introduction 1 Semigroups and their relatives 2 Machines and semigroups 3 Decompositions 4 The holonomy decomposition 5 Recognizers 6 Sequential machines and functions Appendix References Index of notation Indexread more
Citations
More filters
Journal ArticleDOI
Observability of discrete event dynamic systems
C.M. Ozveren,Alan S. Willsky +1 more
TL;DR: In this article, a polynomial test for observability is given and a notion of resiliency is defined for observers, and a test for resilient observability and a procedure for the construction of a resilient observer are presented.
Journal ArticleDOI
Automata theory based on complete residuated lattice-valued logic
TL;DR: A fundamental framework of automata theory based on complete residuated lattice-valued logic is established, from which it follows that the two fuzzy operators are exactly fuzzy closure operators.
Journal ArticleDOI
Characterizations of fuzzy finite automata
Daowen Qiu,Daowen Qiu +1 more
TL;DR: This paper establishes some important concepts in fuzzy finite automata (FFAs) with bifuzzy property, and clarify their essential relationships, and proves a number of equivalent characterizations for these concepts.
Journal ArticleDOI
On subsystems of a fuzzy finite state machine
TL;DR: The ideas of cyclic subsystem, and simple strong subsystem are introduced and their basic properties are examined.
Journal ArticleDOI
Products of T -generalized state machines and T -generalized transformation semigroups
TL;DR: The concepts of T - generalized state machines, T -generalized transformation semigroups, and coverings and direct products of T-generalized state Machines, and some of algebraic properties of them are introduced.