A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Uniform and nonuniform recognizability
2003
Theoretical Computer Science
Deterministic and nondeterministic ÿnite-state recognizability over ÿnite structures are introduced in an algebraic setting, avoiding detailed computational conventions as needed in the deÿnition of ÿnite-state acceptors. For deterministic recognizability, the classical approach is adopted, using a "uniform" homomorphism from the input domain (consisting of terms) into a ÿnite algebra. For the nondeterministic case, we refer to relational input structures and to an acceptance via relational
doi:10.1016/s0304-3975(01)00229-8
fatcat:4btfarn3pfdchiijplmiesg4wa