Sciweavers

70 search results - page 11 / 14
» Polynomial Operators on Classes of Regular Languages
Sort
View
DLT
2008
13 years 8 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
FUIN
2007
114views more  FUIN 2007»
13 years 7 months ago
Cellular Devices and Unary Languages
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...
Andreas Klein, Martin Kutrib
ALT
1998
Springer
13 years 11 months ago
Predictive Learning Models for Concept Drift
Concept drift means that the concept about which data is obtained may shift from time to time, each time after some minimum permanence. Except for this minimum permanence, the con...
John Case, Sanjay Jain, Susanne Kaufmann, Arun Sha...
SIGADA
2005
Springer
14 years 26 days ago
The implementation of ada 2005 synchronized interfaces in the GNAT compiler
One of the most important object-oriented features of the new revision of the Ada Programming Language is the introof Abstract Interfaces to provide a form of multiple nce. Ada 20...
Javier Miranda, Edmond Schonberg, Hristian Kirtche...
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
14 years 1 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...