Abstract. The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructi...
Gerardo Lafferriere, George J. Pappas, Shankar Sas...
In this paper we study the problem of explicitly constructing a dimension expander raised by [BISW04]: Let Fn be the n dimensional linear space over the field F. Find a small (ide...
This paper elaborates a model for representing semantic calendar expressions (SCEs), which correspond to the intensional meanings of natural-language calendar phrases. The model u...
A finite-state method, based on leftmost longestmatch replacement, is presented for segmenting words into graphemes, and for converting graphemes into phonemes. A small set of han...
Abstract. The hierarchy of arbitrary compositions of two-way nondeterministic finite-state transductions collapses when restricted to finitary transductions, i.e., transductions ...