495 search results - page 27 / 99 » Automata and differentiable words |
TACS
2001
Springer
14 years 6 days ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
IMCSIT
2010
13 years 5 months ago
2010
Abstract--There are numerous formats for writing spellcheckers for open-source systems and there are many descriptions for languages written in these formats. Similarly, for word h...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
AB
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Among all the modeling approaches dedicated to cellular biology, differential algebra is particularly related to the well-established one based on nonlinear differential ...
ICDAR
2003
IEEE
14 years 1 months ago
2003
IEEE
Analysis of allographs (characters) and allograph combinations (words) is the key for obtaining the discriminating elements of handwriting. While allographs usually inhabit in wor...