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...

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...

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

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

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...

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....

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

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

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...

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

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

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

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

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...

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

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...

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...

main classes of tree transducers are: A TOP T is a tuple (Q, Σ, Γ, I, δ) such that: Q is a finite set, the set of states; Σ is a finite ranked alphabet, called...

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

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

for natural language processing with finite-state automata and finite-state transducers. It is free and open-source software, released under a mix of the...

Arabic verbs constructed on the basis of Semitic taxonomy and using finite-state transducers Alexis Neme and Eric Laporte (2015), Do computer scientists deeply...

both this pairing function and its inverse can be computed with finite-state transducers that run in real time.[clarification needed] In the same paper...

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

element can be represented in a "normal form" that can be computed by a finite transducer: multiplication in such a monoid is "easy", in the sense that it can...

multi-level fusion includes the following three methodologies: finite-state transducers, multimodal grammars and dialogue moves. User's actions or commands...