We have implemented a package that transforms concise algebraic descriptions of linear block codes into finite automata representations, and also generates decoders from such repre...
Priti Shankar, K. Sasidharan, Vikas Aggarwal, B. S...
Abstract. We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with va...
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
- Adaptive technologies are based on the self-modifying property of some systems, which give their users a very powerful and convenient facility for expressing and handling complex...
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The...