We investigate systems of equations and the first-order theory one-relator monoids. describe a family F monoids form 〈A|w=1〉 where for each monoid M in F, longstanding open problem decidability word with length constraints reduces to Diophantine (i.e. equations) M. achieve this result by finding an interpretation free monoid, using only together relations. It follows that has undecidable positi...

Verification of string manipulation operations is a crucial problem in computer security. We present a new symbolic string verification technique that can be used to prove that vulnerabilities that result from improper string manipulation do not exist in a given program. We formally characterize the string verification problem as the reachability analysis of string systems, programs that contai...

We show that for every n there are two simple curves on the torus intersecting at least n times without the two curves folding or spiralling with respect to each other. On the other hand, two simple curves in a punctured plane that intersect at least n times (and do not create any empty bigons) must either form a spiral of depth d or a fold of width cn/(d + 1) − 1, where c only depends on the n...

using the mean-value theorem for integrals we tried to solved the nonlinear integral equations of hammerstein type . the mean approach is to obtain an initial guess with unknown coefficients for unknown function y(x). the procedure of this method is so fast and don't need high cpu and complicated programming. the advantages of this method are that we can applied for those integral equation...

introduction: one of the important evaluative indexes of language development is word finding ability. the application of formal assessment tools, such as twf-2, is the most common way of assessing this ability in western countries. there is not any formal assessment tool for assessment of this ability in iran. therefore this study aimed to determine the validity and reliability of persian vers...

Modern automatic speech recognition (ASR) systems use statistical models of spoken language. These models are typically learned from corpora comprising many hours of transcribed speech. While a variety of machine learning approaches have been applied to this learning task, the optimal learning strategy is unknown. This thesis focusses upon a relatively recent and successful approach, the applic...