ions of hybrid systems: formal languages to describe dynamical behaviour ⋆ Rebekah Carter, Eva M. Navarro-López School of Computer Science, The University of Manchester Oxford Road, Manchester, M13 9PL, UK (e-mails: [email protected], [email protected]) Abstract: We show how finite-state automata over finite and infinite words can capture key dynamical properties of hybrid systems. Th...

Textual languages are not the only way to write down models. Especially in the field of model-based engineering, graphical languages are gaining more and more popularity. In this regard well-known specification techniques for textual languages like context-free grammars are often substituted by metamodels. Nevertheless do we have to give up the theory of formal languages including their definit...

Although formal and informal control mechanisms are often simultaneously used to govern systems development projects, considerable disagreement exists about whether the use of one strengthens or diminishes the benefits of the other. In other words, are they complements or substitutes? Competing theoretical perspectives favor both sides of the argument, and neither the information systems (IS) c...

Individual languages exhibit variation in phonological structures both within and across words. This chapter examines the constraints placed on the acquisition of these stochastic phonological patterns. Theoretical perspectives on phonological acquisition are reviewed, revealing the importance of both formal and substantive constraints in a wide variety of learning theories. Empirical studies o...

(ii) (Lazard’s Theorem) L is the polynomial algebra Z[x1, x2, ...]. We proved Lazard’s theorem last semester. We also proved that MU∗ is isomorphic to Z[x1, x2, ...], so MU∗ and L are both polynomial algebras with generators in even degrees (positive even degrees in MU∗, and negative even degrees in L). The usual complex orientation on MU gives rise to a formal group law, and thus we have a hom...

Within the framework of Morpho Challenge 2009, we developed an unsupervised morphological analysis system based on formal analogies between words. After the evaluation campaign, we took time to correct some problems in our system and to analyze its main characteristics. This paper focusses on the knowledge we acquired during this post-mortem exercise. We hope this work will contribute to show t...

A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This paper gives a systematic analysis of the properties of groups with combings in various formal language families, and of the closure properties of the associated families of groups; it explores the relationship ...

This paper conjectures a computational account of how children might learn the meanings of words in their native language. First, a simplified version of the lexical acquisition task faced by children is modeled by a precisely specified formal problem. Then, an implemented algorithm for solving this formal problem is presented. Key advances of this algorithm over previously proposed algorithms ...

This paper presents OntoShare, an automated ontology mapping and merging architecture for learning object retrieval and reuse. The architecture aims to offer contextual and robust ontology mapping and merging through hybrid unsupervised clustering techniques comprising of Formal Concept Analysis (FCA), Self-Organizing Map (SOM) and K-Means clustering incorporated with linguistic processing usin...