Search results for "Programming language"
showing 10 items of 624 documents
Recursive modeling for completed code generation
2009
Model-Driven Development is promising to software development because it can reduce the complexity and cost of developing large software systems. The basic idea is the use of different kinds of models during the software development process, transformations between them, and automatic code generation at the end of the development. But unlike the structural parts, fully-automated code generation from the behavior parts is still hard, if it works at all, restricted to specific application areas using a domain specific language, DSL.This paper proposes an approach to model the behavior parts of a system and to embed them into the structural models. The underlying idea is recursive refinements …
Researching Conditional Probability Problem Solving
2014
The chapter is organized into two parts. In the first one, the main protagonist is the conditional probability problem. We show a theoretical study about conditional probability problems, identifying a particular family of problems we call ternary problems of conditional probability. We define the notions of Level, Category and Type of a problem in order to classify them into sub-families and in order to study them better. We also offer a tool we call trinomial graph that functions as a generative model for this family of problems. We show the syntax of the model that allows researchers and teachers to translate a problem in terms of the trinomial graphs language, and the consequences of th…
Multi-Dimensional motivic pattern extraction founded on adaptive redundancy filtering
2005
Abstract We present a computational model for discovering repeated patterns in symbolic representations of monodic music. Patterns are discovered through an incremental adaptive identification along a multi-dimensional parametric space. The difficulties of pattern discovery mainly come from combinatorial redundancies, that our model is able to control efficiently. A specificity relation is defined between pattern descriptions, unifying suffix and inclusion relations and enabling a filtering of redundant descriptions. Combinatorial proliferation caused by successive repetitions of patterns is managed using cyclic patterns. The modelling of these redundancy control mechanisms enables an autom…
Tally languages accepted by Monte Carlo pushdown automata
1997
Rather often difficult (and sometimes even undecidable) problems become easily decidable for tally languages, i.e. for languages in a single-letter alphabet. For instance, the class of languages recognizable by 1-way nondeterministic pushdown automata equals the class of the context-free languages, but the class of the tally languages recognizable by 1-way nondeterministic pushdown automata, contains only regular languages [LP81]. We prove that languages over one-letter alphabet accepted by randomized one-way 1-tape Monte Carlo pushdown automata are regular. However Monte Carlo pushdown automata can be much more concise than deterministic 1-way finite state automata.
Automata and forbidden words
1998
Abstract Let L ( M ) be the (factorial) language avoiding a given anti-factorial language M . We design an automaton accepting L ( M ) and built from the language M . The construction is effective if M is finite. If M is the set of minimal forbidden words of a single word ν, the automaton turns out to be the factor automaton of ν (the minimal automaton accepting the set of factors of ν). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a nontrivial upper bound on the number of minimal forbidden words of a word.
Minimal forbidden words and factor automata
1998
International audience; Let L(M) be the (factorial) language avoiding a given antifactorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eff ective if M is finite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a non-trivial upper bound on the number of minimal forbidden words of a word.
Clarkson-McCarthy inequalities with unitary and isometry orbits
2020
Abstract A refinement of a trace inequality of McCarthy establishing the uniform convexity of the Schatten p-classes for p > 2 is proved: if A , B are two n-by-n matrices, then there exists some pair of n-by-n unitary matrices U , V such that U | A + B 2 | p U ⁎ + V | A − B 2 | p V ⁎ ≤ | A | p + | B | p 2 . A similar statement holds for compact Hilbert space operators. Another improvement of McCarthy's inequality is given via the new operator parallelogramm law, | A + B | 2 ⊕ | A − B | 2 = U 0 ( | A | 2 + | B | 2 ) U 0 ⁎ + V 0 ( | A | 2 + | B | 2 ) V 0 ⁎ for some pair of 2n-by-n isometry matrices U 0 , V 0 .
DSL Tool Development with Transformations and Static Mappings
2009
A tool development framework for domain-specific languages combining mapping and transformation based approaches is proposed in this research project. The combination of both approaches permits to use advantages and eliminate disadvantages as far as possible. First results are described including draft architecture for the framework implementing proposed ideas. A sketch of mapping definition facilities is presented. Initial implementation proposals are described as well. A template based graphical generation language Template MOLA for implementation algorithm description is introduced.
Transformation of the Software Testing Glossary into a Browsable Concept Map
2014
Authors propose a transformation method of the glossary “Standard glossary of terms used in Software Testing” created by ISTQB document into a basic concept map. By applying natural language processing techniques and analyzing the discovered relations between concepts the most essential aspects of the software testing domain are elicited and integrated. As the result a browsable concept map is created. Browsable concept map can be used as a learning support tool.