Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,237,285 papers from all fields of science
Search
Sign In
Create Free Account
Semiautomaton
Known as:
Transition monoid
, S-system
, S-automata
Expand
In mathematics and theoretical computer science, a semiautomaton is a deterministic finite automaton having inputs but no output. It consists of a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Alphabet (formal languages)
De Bruijn graph
Deterministic finite automaton
Finite-state machine
Expand
Broader (1)
Category theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Regular Transducer Expressions for Regular Transformations
V. Dave
,
P. Gastin
,
Krishna Shankara Narayanan
Logic in Computer Science
2018
Corpus ID: 3640533
Functional MSO transductions, deterministic two-way transducers, as well as streaming string transducers are all equivalent…
Expand
2017
2017
Primitivity, Uniform Minimality, and State Complexity of Boolean Operations
Sylvie Davies
Theory of Computing Systems
2017
Corpus ID: 4326371
A minimal deterministic finite automaton (DFA) is uniformly minimal if it always remains minimal when the final state set is…
Expand
2009
2009
Tipu's Tigers
S. Stronge
,
Victoria
2009
Corpus ID: 190572034
Tipu's Tiger is one of the V&A's most enduringly famous and fascinating objects. Commissioned in the 1790s by Tipu Sultan of…
Expand
Highly Cited
2005
Highly Cited
2005
Inference of gene regulatory networks using s-system and differential evolution
N. Noman
,
H. Iba
Annual Conference on Genetic and Evolutionary…
2005
Corpus ID: 169035
In this work we present an improved evolutionary method for inferring S-system model of genetic networks from the time series…
Expand
1999
1999
Linear Cellular Automata and de Bruijn Automata
Klaus Sutner
1999
Corpus ID: 117830666
Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs…
Expand
Highly Cited
1999
Highly Cited
1999
Jewels are Forever
J. Karhumäki
,
H. Maurer
,
G. Paun
,
G. Rozenberg
Springer Berlin Heidelberg
1999
Corpus ID: 30178955
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…
Expand
1988
1988
Computer programs for investigating syntactic near-rings of finite group-semiautomata
Y. Fong
,
J. R. Clay
1988
Corpus ID: 61429763
1988
1988
On s-automata
Klaus Sutner
1988
Corpus ID: 117193593
1973
1973
On Some Measures on Free Semigroups Induced by Semiautomata
D. Simovici
International Symposium on Mathematical…
1973
Corpus ID: 35100348
1972
1972
Restricted Sperner families and s-Systems
Murray Hochberg
Discrete Mathematics
1972
Corpus ID: 45038572
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)
ACCEPT & CONTINUE