Showing papers on "Concatenation published in 1982"

System operable as an automation for recognizing continuously spoken words with reference to demi- word pair reference patterns

Abstract: A system for recognizing a continuously spoken word sequence with reference to preselected reference words with the problem of coarticulation removed, comprises a pattern memory for memorizing demi-word pair reference patterns consisting of a former and a latter reference pattern segment for each reference word and a word pair reference pattern segment for each permutation with repetition of two words selected from the preselected reference words. A recognition unit is operable as a finite-state automaton on concatenating the demi-word pair reference patterns so that no contradiction occurs at each interface of the reference patterns in every concatenation. It is possible to use the automaton in restricting the number of reference patterns in each concatenation either to an odd or an even positive integer.

Concatenation of restricted characteristic functions

Abstract: The mathematical process of combining the characteristic functions of two optical systems to obtain the characteristic function of the system created by adjoining these component systems is shown to be identical for restricted point, mixed, and angle characteristics. Consequently, the applicability of the technique of concatenation is significantly extended. By way of example, the angle characteristic of a refracting surface is considered; the explicit power series for the angle characteristic of a symmetric refracting surface is given to within terms of degree ten.

Concatenation of characteristic functions in Hamiltonian optics

Abstract: A procedure is developed for the determination of the Taylor coefficients of the characteristic function of an optical system given the corresponding coefficients of its component parts. No symmetry properties are assumed, and, in principle, there is no limitation to the order to which the calculations can be carried out. Whereas earlier investigations have assumed that the elementary characteristic functions to be concatenated are those of a region bounded by two planes and containing one refracting surface, it is suggested that the homogeneous regions between two such refracting surfaces (i.e., the optical elements or the air spaces between them) are more appropriate. Since the point characteristic of such regions can be readily calculated, this concatenation procedure provides a basis for the analysis of most optical systems.

Multihead Finite State Automata and Concatenation

Abstract: The following results are shown : (1) The class of languages accepted by the one-way nondeterministic simple k-head finite automata ℒ(NSPk-HFA) is not closed under concatenation for any k≥2. (2) The class k U ℒ(NSPk-HFA) is closed under concatenation. (3) The class of languages recognized by one-way k-head deterministic finite state automata ℒ(1DFA(k)) and the class of languages recognized by one-way k-head deterministic sensing finite state automata ℒ(1DSeFA(k)) are not closed under concatenation, Kleene star and reversal.

Graphic image coding based on a pattern-dependent runlength model

Abstract: A new graphic image coding based on a pattern-dependent runlength model is investigated. The binary image is considered as a concatenation of alternating white and black runs the probability of occurrence of which is dependent on the pattern of neighbouring runs. Based on this model, an optimum coding strategy is obtained for the case of simplified composite states. Simulation results show its better performance over conventional schemes.