Sciweavers

1146 search results - page 50 / 230
» Finite cupping sets
Sort
View
HYBRID
1997
Springer
13 years 12 months ago
Hybrid Systems with Finite Bisimulations
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...
COCO
2008
Springer
79views Algorithms» more  COCO 2008»
13 years 9 months ago
Towards Dimension Expanders over Finite Fields
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...
Zeev Dvir, Amir Shpilka
COLING
2008
13 years 9 months ago
Quantification and Implication in Semantic Calendar Expressions Represented with Finite-State Transducers
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...
Jyrki Niemi, Kimmo Koskenniemi
ANLP
2000
86views more  ANLP 2000»
13 years 9 months ago
A Finite State and Data-Oriented Method for Grapheme to Phoneme Conversion
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...
Gosse Bouma
FUIN
2007
93views more  FUIN 2007»
13 years 7 months ago
Finitary Compositions of Two-way Finite-State Transductions
Abstract. The hierarchy of arbitrary compositions of two-way nondeterministic finite-state transductions collapses when restricted to finitary transductions, i.e., transductions ...
Joost Engelfriet, Hendrik Jan Hoogeboom