A finite-state transducer (FST) is a finite-state machine with two memory tapes, following the terminology for Turing machines: an input tape and an output...

generalized in multiple ways, e.g., nondeterministic finite automata with ε-moves, finite-state transducers, pushdown automata, alternating automata, ω-automata...

regular language) can be implemented using a finite state transducer. And, since finite state transducers are closed under composition, every sequence...

A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of...

determined solely by its current state. A Mealy machine is a deterministic finite-state transducer: for each state and input, at most one transition...

nested weighted automata, cost register automata, and weighted finite-state transducers. Researchers have studied weighted automata from the perspective...

phonological rules and sound change, are computationally equivalent to finite-state transducers, provided that application is nonrecursive, i.e. the rule is not...

The notion of unambiguity extends to finite state transducers and weighted automata. If a finite state transducer T is unambiguous, then each input word...

stream of morphologically analysed tokens, typically produced by a Finite-state transducer-based analyser (common ones are the Xerox tools twolc/lexc/xfst...

learning software File Streaming Technology, a digital audio format Finite-state transducer Full-Scale Tunnel, a demolished NASA wind tunnel Fenchurch Street...

lattices represented as weighted finite state transducers with edit distances represented themselves as a finite state transducer verifying certain assumptions...

Apertium is a transfer-based machine translation system, which uses finite state transducers for all of its lexical transformations, and Constraint Grammar...

differential calculus to describe material systems. The theory of the finite-state transducer was developed under different names by different research communities...

accepted approach to morphological parsing is through the use of a finite state transducer (FST), which inputs words and outputs their stem and modifiers...

v t e In computation, a finite-state machine (FSM) is event driven if the transition from one state to another is triggered by an event or a message....

UniMorph in particular, has been subject of numerous shared tasks. Finite State Transducers (FSTs) are a popular technique for the computational handling of...

finitary tree finite Fourier transform (discrete Fourier transform) finite-state machine finite state machine minimization finite-state transducer first come...

whose rule set is modified according to instructions output by a finite state transducer when reading the terminal prefix during a leftmost derivation....

computer scientist who invented the namesake Mealy machine, a type of finite state transducer. He was also a pioneer of modular programming, one of the lead...

can be applied to a crystal design. The weights in a weighted finite-state transducer are often required to be a tropical semiring. Tropical geometry...

declarative description of the page schema, regular expressions and finite state transducer are used in order to extract information. JWKTL (Java Wiktionary...

arrives. A Moore machine can be regarded as a restricted type of finite-state transducer. A state transition table is a table listing all the triples in the...

analysis. The basic description of language is made using the finite-state transducers, first developed by Kimmo Koskenniemi. The individual words are...

which uses lattice graphs) and morphology (e.g. finite-state morphology, using finite-state transducers) are common in the analysis of language as a graph...

application of finite-state transducers to phonology and morphology. Karttunen and Kenneth R. Beesley published a textbook on Finite State Morphology and...

General Architecture for Text Engineering (GATE) platform. JAPE is a finite state transducer that operates over annotations based on regular expressions. LOLITA...

General Architecture for Text Engineering (GATE) platform. JAPE is a finite state transducer that operates over annotations based on regular expressions. Thus...

UNICAMP Jorge also worked with C. Lucchesi and T.Kowaltowski on finite state transducer technology for spell checking and other natural language processing...

third finite automaton construction of Levenshtein (or Damerau–Levenshtein) distance are the Levenshtein transducers of Hassan et al., who show finite state...

a nondeterministic finite-state transducer that performs the transition rule of the automaton on periodic strings. This transducer works by remembering...