Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
Alphabet (formal languages)De Bruijn graphDeterministic finite automatonFinite-state machine

Broader (1)

Category theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Representation of Semiautomata by Canonical Words and Equivalences, Part II: Specification of Software Modules
A theory of representation of semiautomata by canonical words and equivalences was developed in [7]. That work was motivated by… 
2005
2005
Errata: "representation of Semiautomata by Canonical Words and Equivalences"
In the paper [1], Theorem 23 and Example 24 are incorrect. The corrected version is presented in this note. 
2004
2004
Theory of Deterministic Trace-Assertion Specications ?
A software module is an abstraction of a program: it has a well dened functionality, operations by which the environment ac… 
2002
2002
Reduced power automata
We describe a class of transitive semiautomata whose power automata are reduced: any two reachable sets of states have distinct… 
1999
1999
Linear Cellular Automata and de Bruijn Automata
Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs… 
Highly Cited
1999
Highly Cited
1999
Jewels are Forever
ly we have the following setting for our problem. We are given a finite set S of generators and a finite set E of equations of… 
1988
1988
Computer programs for investigating syntactic near-rings of finite group-semiautomata
1988
1988
On s-automata
1973
1973
On Some Measures on Free Semigroups Induced by Semiautomata
1971
1971
Congruences et Automorphismes des Automates Finis
SummaryWe study a class of congruences of strongly connected finite automata, called the group congruences, which may be defined… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)