Sciweavers

1052 search results - page 87 / 211
» The Regular Real-Time Languages
Sort
View
114
Voted
COGSCI
2011
85views more  COGSCI 2011»
14 years 10 months ago
Adaptation to Novel Accents: Feature-Based Learning of Context-Sensitive Phonological Regularities
This paper examines whether adults can adapt to novel accents of their native language that contain unfamiliar context-dependent phonological alternations. In two experiments, Fre...
Katrin Skoruppa, Sharon Peperkamp
143
Voted
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 8 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
DLT
2003
15 years 5 months ago
NFA Reduction Algorithms by Means of Regular Inequalities
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
Jean-Marc Champarnaud, Fabien Coulon
152
Voted
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
15 years 3 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
WIA
2004
Springer
15 years 9 months ago
The Generalization of Generalized Automata: Expression Automata
Abstract. We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approac...
Yo-Sub Han, Derick Wood