OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Aperiodic finite state automaton

 Home Mathematics Fields of mathematics Applied mathematics Applied mathematics stubs Theoretical computer science stubs
 0 By others on same topic  0 Discussions  1970-01-01  See my version
An **aperiodic finite state automaton (AFSA)** is a type of finite state automaton (FSA) that possesses certain structural characteristics related to the periodicity of its states. In the context of automata theory, the concept of periodicity has to do with the behavior of the automaton as it processes inputs.

 Ancestors (6)

  1. Theoretical computer science stubs
  2. Applied mathematics stubs
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook