2467 search results - page 60 / 494 » Finite State Machines |
101
Voted
EACL
2009
ACL Anthology
2009
ACL Anthology
Semitic Morphological Analysis and Generation Using Finite State Transducers with Feature Structures
16 years 1 months ago
This paper presents an application of finite state transducers weighted with feature structure descriptions, following Amtrup (2003), to the morphology of the Semitic language Tig...
117
click to vote
TNN
2010
14 years 7 months ago
2010
A class of recurrent neural networks is proposed and proven to be capable of identifying any discrete-time dynamical system. The application of the proposed network is addressed in...
129
Voted
IC
2004
15 years 2 months ago
2004
This paper describes a validating XML parsing method based on deterministic finite state automata (DFA). XML parsing and validation is performed by a schema-specific XML parser th...
101
click to vote
JSYML
2008
15 years 16 days ago
2008
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formu...
92
Voted
SOFSEM
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularit...