Semiautomaton

Known as: Transition monoid, S-system, S-automata

In mathematics and theoretical computer science, a semiautomaton is a deterministic finite automaton having inputs but no output. It consists of a…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

Let M be a left R-module. In this paper a generalization of the notion of an s-system of rings to modules is given. Let N be a…

2009

Tipu's Tiger is one of the V&A's most enduringly famous and fascinating objects. Commissioned in the 1790s by Tipu Sultan of…

2006

This work has introduced a fast and reliable method for graphical modeling of discrete systems control problems using extended S…

2004

A software module is an abstraction of a program: it has a well dened functionality, operations by which the environment ac…

2003

Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs…

2003

On supported algebras Janis Cirulis University of Latvia Given a (countable) set of variables Var, we call a supported algebra a…

1995

I present the QCD short distance coefficient η3 of the ∆S = 2 hamiltonian in the next-to-leading order (NLO) of renormalization…

1988

1988

1973