Title of the Article : Abstract family of acceptors

An abstract family of acceptors (AFA) is a grouping of generalized acceptors. Informally, an acceptor is a device with a finite state control, a finite number of input symbols, and an internal store with a read and write function. Each acceptor has a start state and a set of accepting states. The device reads a sequence of symbols, transitioning from state to state for each input symbol. If the device ends in an accepting state, the device is said to accept the sequence of symbols. A family of acceptors is a set of acceptors with the same type of internal store. The study of AFA is part of AFL (abstract families of languages) theory.

[Last contributor : CmdrObot , Content under LGPL licence]

Detailed statistics

Number of views for this article Number of quality votes for this article Number of votes 'not clear' for this article Number of votes 'wrong' for this article
daily 1 0 0 0
global 308 3 37 6
This is a quality article
This article is not clear!
This article is wrong

Participate in this top by giving your opinion on the quality of this article short resume and by giving a general rating.
Register in order to improve your reputation and so the weight of your opinion.

Please wait...
Item popularity: 1.7/5 (12 vote cast)

Categories related to this article

Formal languages

Comments