Results 271 to 280 of about 329,610 (317)

Pseudo-minimal transducers: A transducer with proper elements

1998
The algorithm that we present here is an adaptation of the automata pseudo- minimization algorithm for finite-state transducer. After giving some definitions, we give an algorithm to build a pseudominimal transducer, that has an interesting property: each recognized word has a proper element.
Denis Maurel, Laurent Chauvier
openaire   +1 more source

Transducers III—Other Transducers

1996
Crystals have always had a fascination for people. Are not diamonds a girl’s best friend? Their perfect shapes, their colours and the way they can be grown from a clear solution have long had a fascination. They have been (and are) involved in magic and sorcery and ‘new age’ religion. But they also have considerable scientific importance.
openaire   +1 more source

From IPMC Transducers to All-Organic Transducers

2013
This paper presents a summary about the research activity performed on characterizations and modeling of new polymeric transducers. More specifically, Ionic Polymer–Metal Composites (IPMCs) have been widely explored and a new class of totally organic transducers: Ionic Polymer-Polymer Composites (IP2Cs) have been introduced. The manufacturing technique,
DI PASQUALE, Giovanna, GRAZIANI, Salvatore, Umana E.   +2 more
openaire   +1 more source

Weighted Tree Transducers

J. Autom. Lang. Comb., 2004
Journal of Automata, Languages and Combinatorics, Volume 9, Number 1, 2004, 31 ...
Zoltán Fülöp 0001, Heiko Vogler
openaire   +2 more sources

Electret transducer backplate, electret transducer, and method of making an electret transducer

The Journal of the Acoustical Society of America, 1982
An electret transducer backplate is made of a thermo-softening plastics material rendered electrically conducting by electrically conducting particles distributed therethrough. An electret foil diaphragm is mounted on the backplate and the relative flexural rigidities of the diaphragm and the backplate are such that, in use, the deflection of the ...
Adrian J. Morgan, John K. Williams, Ronald Else   +2 more
openaire   +1 more source

Deterministic Stack Transducers

International Journal of Foundations of Computer Science, 2016
We introduce and investigate stack transducers, which are one-way stack automata with an output tape. A one-way stack automaton is a classical pushdown automaton with the additional ability to move the stack head inside the stack without altering the contents. For stack transducers, we distinguish between a digging and a non-digging mode.
Suna Bensch, Johanna Björklund, Martin Kutrib   +2 more
openaire   +1 more source

FINITELY SUBSEQUENTIAL TRANSDUCERS

International Journal of Foundations of Computer Science, 2003
Finitely subsequential transducers are efficient finite-state transducers with a finite number of final outputs and are used in a variety of applications. Not all transducers admit equivalent finitely subsequential transducers however. We briefly describe an existing generalized determinization algorithm for finitely subsequential transducers and give
Cyril Allauzen, Mehryar Mohri
openaire   +2 more sources

Transducers are type‐converters

Software: Practice and Experience, 1984
AbstractThe nature of a transducer is shown to be a mapping between representations (internal and external), analogous to the mapping between internal representations provided by typeconversion. Examples of this idea are given through programs in Ada and Modula.
openaire   +1 more source

The Wedged Transducer — A Transducer Design for Broad Band Characteristics

Ultrasonic Imaging, 1979
This paper presents a method of increasing the bandwidth of transducers feeding low acoustic impedance loads such as fluids and of electrically matching them over the full bandwidth. It consists of interposing between the transducer and the actual load, a wedge made out of a material having the desired acoustic impedance. The wedge angle is chosen such
openaire   +2 more sources

Minimization of Symbolic Transducers

2017
Symbolic transducers extend classical finite state transducers to infinite or large alphabets like Unicode, and are a popular tool in areas requiring reasoning over string transformations where traditional techniques do not scale. Here we develop the theory for and an algorithm for computing quotients of such transducers under indistinguishability ...
Olli Saarikivi, Margus Veanes
openaire   +1 more source