نتایج جستجو برای: syntactic simplification

تعداد نتایج: 36897  

2002
Min-Joo Kim M.-J. Kim

This paper argues that Korean lacks a distinct, open category of Adjective; what have been traditionally analyzed as adjectives are a kind of stative verbs. I propose that apparent noun-modifying adjectives in Korean are predicates inside relative clauses. The proposed analysis makes several predictions about the syntax and semantics of noun modifiers in Korean. In particular, it predicts that ...

Journal: :Acta Cybern. 2005
Saeed Salehi

An algebraic characterization of the families of tree languages definable by syntactic monoids is presented. This settles a question raised by several

Journal: :CoRR 2016
Ondrej Klíma Libor Polák

We introduce here the notion of syntactic lattice algebra which is an analogy of the syntactic monoid and of the syntactic semiring. We present a unified approach to get those three structures.

2002

This paper looks at representing paraphrases using the formalism of Synchronous TAGs; it looks particularly at comparisons with machine translation and the modifications it is necessary to make to Synchronous TAGs for paraphrasing. A more detailed version is in Dras (1997a). 1 I n t r o d u c t i o n The context of the paraphrasing in this work is that of Reluctant Paraphrase (Dras, 1997b). In ...

Journal: :Theor. Comput. Sci. 2017
Jean-Éric Pin Pedro V. Silva

Given a variety of finite monoids V, a subset of a monoid is a V-subset if its syntactic monoid belongs to V. A function between two monoids is V-preserving if it preservesV-subsets under preimages and it is hereditary V-preserving if it is W-preserving for every subvariety W of V. The aim of this paper is to study hereditary V-preserving functions when V is one of the following varieties of fi...

2014
Janusz A. Brzozowski Marek Szykula

We solve two open problems concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a left ideal or a suffix-closed language with n left quotients (that is, with state complexity n) is at most n n−1 + n − 1, and that of a two-sided ideal or a factor-closed language is at most n n−2 + (n − 2)2 n−2 + 1. Since these bounds are known to be reachable, this settles...

Journal: :ITA 1980
Aldo de Luca

— Some synchronizing properties of"very pure" subsemigroups ofafree semigroup are shown by means of an analysis of the properties of their syntactic semigroups. Résumé. — On démontre certaines propriétés de synchronisation pour les sous-semigroupes « très purs » d'un semigroupe libre, en analysant les propriétés de leurs semigroupes syntactiques.

2014
Janusz A. Brzozowski Gareth Davies

A right ideal is a language L over an alphabet Σ that satisfies L = LΣ∗. We show that there exists a stream (sequence) (Rn | n > 3) of regular right ideal languages, where Rn has n left quotients and is most complex under the following measures of complexity: the state complexities of the left quotients, the number of atoms (intersections of complemented and uncomplemented left quotients), the ...

Journal: :CoRR 2017
Subhadip Chowdhury

We give a new proof of Salvati’s theorem that the group language O2 is 2 multiple context free. Unlike Salvati’s proof, our arguments do not use any idea specific to two-dimensions. This raises the possibility that the argument might generalize to On.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید