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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Functional MSO transductions, deterministic two-way transducers, as well as streaming string transducers are all equivalent… 
2017
2017
A minimal deterministic finite automaton (DFA) is uniformly minimal if it always remains minimal when the final state set is… 
2009
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… 
Highly Cited
2005
Highly Cited
2005
In this work we present an improved evolutionary method for inferring S-system model of genetic networks from the time series… 
1999
1999
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
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