Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,318 papers from all fields of science
Search
Sign In
Create Free Account
Aperiodic finite state automaton
Known as:
Aperiodic (disambiguation)
, Counter-free automaton
, Counter-free language
An aperiodic finite-state automaton is a finite-state automaton whose transition monoid is aperiodic.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Automata theory
Regular language
Star-free language
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
1 9 Se p 20 06 Algebraic Recognizability of Languages ⋆
P. Weil
,
V. Koubek
2016
Corpus ID: 39131385
Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a…
Expand
2006
2006
Role of heterogeneous reactions in generating chaos and noise in oscillatory chemical reactions
R. Rastogi
,
I. Das
,
P. K. Srivastava
,
P. Chand
,
Sharwan Kumar
2006
Corpus ID: 16661394
In view of the importance of noise in physiology, information processing and finance, studies on chaos and noise have been…
Expand
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