In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata in [1]. The wellformedness conditions for the automata are specified ensuring unitarity of evolution. A special kind of QF1CA, called simple, that satisfies the well-formedness conditions is introduced. That allows specif...

There is a fundamental difference between grammar and style checking: Grammar checking tries to find ill-formedness which by definition is considered to be a mistake and MUST be corrected; style checking has to do with well-formed but somehow marked text. As a result, style checking has to be much more "liberal" as it has to do with "deviations" which might have been intended by the author, but...

This contribution is concerned with integrating the phenomenon of selectional restrictions in HPSG. Firstly, the question of treating selectional restrictions purely in the semantic module is tackled, as there are some contextual (or pragmatic) influences, which can repair the ill-formedness of violated selectional restrictions. Secondly, we present existing approaches to selectional restrictio...

The management of metamodels is supported by runtime environments that enforce the well-formedness of (meta-)model instances. Beyond this basic functionality, additional capabilities are needed in order to successfully establish a toolchain for Model-Driven Software Engineering. We focus on two such capabilities: transactions and efficient evaluation of invariants, not in the usual context of d...

a. The Hierarchy of Grammatical Relations: 1 (Subject) >> 2 (Direct Object) >> 3 (Indirect Object) >> Nonterms (Oblique, Chômeur) b. Any stratum (= level of grammatical representation) contains at most one instance of each GR (Stratal Uniqueness Law). c. Nominals can travel up the hierarchy (advancement) or down (demotion). d. If X bears a specific GR and Y is advanced to this GR, X is put en c...

This paper presents a connectionist model of verb argument structure assignment that relies on probabilistic information regarding particular verbs, as well as semantic information shared among several verbs. The model illustrates how co-occurrence relations among different levels of linguistic representation may interact in acquisition by contributing to the discovery of language specific well...

Background in music psychology and music computation. In Lerdahl and Jackendoff’s Generative Theory of Tonal Music (1983), the authors try to formalize cognitive processes seen in music, referring to Chomskyan (generative) linguistics. Among other processes found in musical cognition (such as harmonic tension and detecting rhythmic patterns), Lerdahl and Jackendoff describe the process of group...

We extend Combinatory Categorial Grammar (CCG) with a generalized notion of multidimensional sign, inspired by the types of representations found in constraint-based frameworks like HPSG or LFG. The generalized sign allows multiple levels to share information, but only in a resource-bounded way through a very restricted indexation mechanism. This improves representational perspicuity without in...

In this paper UML statechart diagrams are used as an example of a generic approach to integrating a visual language in a heterogeneous modelling and simulation environment. A system represented in a visual language is syntactically defined as an attributed graph, with well-formedness rules specified by a set of first-order predicates over the abstract syntax of the graph. The language semantics...

Dependency Grammar has been used by linguists as the basis of the syntactic components of their grammar formalisms. It has also been used in natural langauge parsing. In China, attempts have been made to use this grammar formalism to parse Chinese sentences using corpus-based techniques. This paper reviews the properties of Dependency Grammar as embodied in four axioms for the well-formedness c...