Sciweavers

513 search results - page 1 / 103
» Finitely Based, Finite Sets of Words
Sort
View
IJAC
2000
70views more  IJAC 2000»
13 years 4 months ago
Finitely Based, Finite Sets of Words
For W a finite set of words, we consider the Rees quotient of a free monoid with respect to the ideal consisting of all words that are not subwords of W. This monoid is denoted by...
Marcel Jackson, Olga Sapir
SIAMNUM
2010
114views more  SIAMNUM 2010»
12 years 11 months ago
A Posteriori Error Estimation Based on Potential and Flux Reconstruction for the Heat Equation
We derive a posteriori error estimates for the discretization of the heat equation in a unified and fully discrete setting comprising the discontinuous Galerkin, finite volume, mix...
Alexandre Ern, Martin Vohralík
SIAMAM
2008
121views more  SIAMAM 2008»
13 years 4 months ago
A Level Set Approach to Anisotropic Surface Evolution with Free Adatoms
We variationally derive a thermodynamically consistent model for surface evolution under the influence of free adatoms. The resulting system of nonlinear partial differential equat...
Christina Stöcker, Axel Voigt
INFORMATICALT
2000
160views more  INFORMATICALT 2000»
13 years 4 months ago
An Algorithm for Transformation of Finite Automata to Regular Expressions
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
Larisa Stanevichene, Aleksei Vylitok
FFA
2006
69views more  FFA 2006»
13 years 4 months ago
Information sets and partial permutation decoding for codes from finite geometries
We determine information sets for the generalized Reed-Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also ...
Jennifer D. Key, T. P. McDonough, Vassili C. Mavro...