110 search results - page 3 / 22 » Finite-State Registered Automata and Their Uses in Natural L... |
IMCSIT
2010
13 years 3 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...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
WIA
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
SSPR
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Recently, a number of authors have explored the use of recursive recursive neural nets (RNN) for the adaptive processing of trees or tree-like structures. One of the most...
FSMNLP
2005
Springer
13 years 11 months ago
2005
Springer
This paper presents SFST-PL, a programming language for finite state transducers which is based on extended regular expressions with variables. The programming language is both si...