RTAFARoyal Thai Air Force Academy (Thailand)
Copyright 1988-2018 AcronymFinder.com, All rights reserved.
References in periodicals archive ?
Based on this, the rtAFA A counts the length of the input modulo [2.sup.k+1] and verifies, for the binary representation of this length, that the last k + 1 bits are all equal to zero.
We are now ready to present the set of states for the rtAFA A, together with their brief description:
For each l [greater than or equal to] 0, each i = k, ..., 0, and each x [member of] {0,1}, the rtAFA A has an accepting alternating subtree of computation paths rooted in the state [i.sub.x] at the input position l (measured from the end of the input) if and only if the ith bit of l is equal to x.