We introduce and study three notions of typeness for automata on infinite words. For an acceptance-condition class γ (that is, γ is weak, Büchi, co-Büchi, Rabin, or Streett), deterministic γ-typeness asks for the existence of an equivalent γ-automaton on the same deterministic structure, nondeterministic γ-typeness asks for the existence of an equivalent γ-automaton on the same structure, and γ...

Models of bilingual speech production generally assume that translation equivalent lexical nodes share a common semantic representation. Though this type of architecture is highly desirable on both theoretical and empirical grounds, it could create difficulty at the point of lexical selection. If two translation equivalent lexical nodes are activated to roughly equal levels every time that thei...

This paper is about generation of translation equivalent of agentive nouns with the use of automatically learned two-level phonological rules. The system is implemented using the PC-KIMMO environment. The basis for the research presented in this paper are two lexicons that contain a list of agentive nouns in Macedonian and English including their components (noun, verb, adjective, pronoun) and ...

It is well known that the model categories of universal Horn theories are locally presentable, hence essentially algebraic [2]. In the special case of quasivarieties a direct translation of the implicational syntax into the essentially equational one is known [1]. Here we present a similar translation for the general case, showing at the same time that many relationally presented Horn classes a...

Judgment aggregation problems are language dependent in that they may be framed in different yet equivalent ways. We formalize this dependence via the notion of translation invariance, adopted from the philosophy of science, and we argue for its normative desirability. We show that in the canonical judgment aggregation model, no reasonable judgment aggregation functions are translation invarian...

The aim of any Automatic Translation project is to give a mechanical procedure for finding an equivalent expression in the target lan6uage for any sentence in the source lan6uage. The aim of any lin6uistic translation project is to find the corresponding structures of the languages dealt with. With both of these aims in mind, the empirical method was adopted in the project described in this paper.

Three new algorithms for 2D translation image registration to within a small fraction of a pixel that use nonlinear optimization and matrix-multiply discrete Fourier transforms are compared. These algorithms can achieve registration with an accuracy equivalent to that of the conventional fast Fourier transform upsampling approach in a small fraction of the computation time and with greatly redu...

For optical metrology by transverse translation diversity phase retrieval (or ptychography), information theoretic limits on the ability to estimate subaperture translation, essential for accurate metrology, are assessed as a function of the optical aberrations of the system being measured. Special attention is given to the case that an unknown linear phase aberration, or equivalent detector or...

Planning in hybrid domains poses a special challenge due to the involved mixed discrete-continuous dynamics. A recent solving approach for such domains is based on applying model checking techniques on a translation of PDDL+ planning problems to hybrid automata. However, the proposed translation is limited because must behavior is only overapproximated, and hence, processes and events are not r...