223 search results - page 20 / 45 » Construction of Tree Automata from Regular Expressions |
SAS
2001
Springer
13 years 12 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
AUSAI
2003
Springer
14 years 23 days ago
2003
Springer
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
CUZA
2010
13 years 5 months ago
2010
In this paper, we describe a symbolic synthesis method which given an algebraic expression that specifies a bitstream function f, constructs a (minimal) Mealy machine that realise...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
Screen readers, the dominant assistive technology used by visually impaired people to access the Web, function by speaking out the content of the screen serially. Using screen rea...
CP
2000
Springer
13 years 11 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...