Sciweavers

3001 search results - page 185 / 601
» Recursive type generativity
Sort
View
ITA
2006
15 years 6 months ago
Decision problems among the main subfamilies of rational relations
We consider the four families of recognizable, synchronous, deterministic rational and rational subsets of a direct product of free monoids. They form a strict hierarchy and we in...
Olivier Carton, Christian Choffrut, Serge Grigorie...
ENTCS
2007
121views more  ENTCS 2007»
15 years 6 months ago
Rewrite-Based Decision Procedures
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
Maria Paola Bonacina, Mnacho Echenim
AI
2002
Springer
15 years 6 months ago
A Constructive Approach to Parsing with Neural Networks - The Hybrid Connectionist Parsing Method
The concept of Dynamic Neural Networks (DNN) is a new approach within the Neural Network paradigm, which is based on the dynamic construction of Neural Networks during the processi...
Christel Kemke
COMBINATORICS
2004
84views more  COMBINATORICS 2004»
15 years 6 months ago
Planar Maps as Labeled Mobiles
We extend Schaeffer's bijection between rooted quadrangulations and welllabeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bi...
J. Bouttier, P. Di Francesco, E. Guitter
ETT
2000
106views Education» more  ETT 2000»
15 years 6 months ago
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
Igal Sason, Shlomo Shamai