Sciweavers

644 search results - page 58 / 129
» Precedence Automata and Languages
Sort
View
SCP
2010
174views more  SCP 2010»
14 years 11 months ago
Aspects of availability: Enforcing timed properties to prevent denial of service
We propose a domain-specific aspect language to prevent denial of service caused by resource management. Our aspects specify availability policies by enforcing time limits in the ...
Pascal Fradet, Stéphane Hong Tuan Ha
FSMNLP
2005
Springer
15 years 10 months ago
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...
Alexander Geyken, Thomas Hanneforth
LATIN
1992
Springer
15 years 8 months ago
On Reversible Automata
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
Jean-Eric Pin
ENTCS
2006
123views more  ENTCS 2006»
15 years 4 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond
WIA
2007
Springer
15 years 10 months ago
Backward and Forward Bisimulation Minimisation of Tree Automata
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Mini...
Johanna Högberg, Andreas Maletti, Jonathan Ma...