Sciweavers

2467 search results - page 225 / 494
» Finite State Machines
Sort
View
NLDB
2007
Springer
16 years 24 days ago
Electronic Dictionaries and Transducers for Automatic Processing of the Albanian Language
We intend on developing electronic dictionaries and Finite State Transducers for the automatic processing of the Albanian Language. We describe some peculiarities of this language ...
Odile Piton, Klara Lagji, Remzi Përnaska
ICDAR
2003
IEEE
15 years 12 months ago
Handwritten Word Recognition based on Structural Characteristics and Lexical Support
In this paper a handwritten recognition algorithm based on structural characteristics, histograms and profiles, is presented. The well-known horizontal and vertical histograms are...
Ergina Kavallieratou, Kyriakos N. Sgarbas, Nikos F...
MEMOCODE
2003
IEEE
15 years 12 months ago
Exact Runtime Analysis Using Automata-Based Symbolic Simulation
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
Tobias Schüle, Klaus Schneider
FMCAD
2006
Springer
15 years 10 months ago
Over-Approximating Boolean Programs with Unbounded Thread Creation
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
Byron Cook, Daniel Kroening, Natasha Sharygina
BIRTHDAY
2008
Springer
15 years 8 months ago
Unfolding Graph Transformation Systems: Theory and Applications to Verification
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
Paolo Baldan, Andrea Corradini, Barbara König