ORTHOGONAL SHUFFLE ON TRAJECTORIES

2011 ◽  
Vol 22 (01) ◽  
pp. 213-222
Author(s):  
MARK DALEY ◽  
LILA KARI ◽  
SHINNOSUKE SEKI ◽  
PETR SOSÌK
Keyword(s):  
Language Equations ◽  
Language L

A language L is called the orthogonal shuffle of the language L1 with the language L2, along the trajectory set T if every word in L is uniquely obtained as the shuffle between a word in L1, a word in L2 along a trajectory word in T. In this paper we investigate properties of the orthogonal shuffle on trajectories, as well as several types of language equations using this language operation. As a corollary, we obtain several properties of orthogonal catenation, orthogonal literal shuffle and orthogonal insertion.

Thought and Language. L. S. Vygotsky , E. Hanfmann , G. Vakar

1964 ◽  
Vol 31 (2) ◽  
pp. 190-191
Author(s):  
Virgil Hinshaw,
Keyword(s):  
Language L

scholarly journals A Language for the Description of Program Instrumentation and Automatic Generation of Instrumenters

2018 ◽  
Vol 6 (1) ◽  
Author(s):  
Adenilso S. Simao ◽  
Auri M. R. Vincenzi ◽  
Antonio C. L. Santana ◽  
Jose C. Maldonado
Keyword(s):  
Automatic Generation ◽  
Product Structure ◽  
C Language ◽  
Program Instrumentation ◽  
Language L ◽  
Transformational Programming ◽  
Software Product ◽  
Target Languages ◽  
Context Free ◽  
Testing Criteria

Instrumentation is a technique frequently used in software engineering for several different purposes, e.g. program and/or specification execution trace, testing criteria coverage analy- sis, and reverse engineering. Instrumenting a software product can be divided into two main tasks: (i) deriving the software product structure and (ii) inserting statements for collecting runtime/simulation information. Most instrumentation approaches are specific to a given domain or language. Thus, it is very difficult to reuse the effort expended in developing an instrumenter, even if the target languages are quite similar. To tackle this problem, in this paper, we propose an instrumentation-oriented meta-language, named IDeL, designed to support the description of both main tasks of instru- mentation process, namely: (i) the product structure derivation and (ii) the insertion of the instrumentation statements. In order to apply IDeL to a specific language L, it should be in- stantiated with a context-free grammar of L. To promote IDeL’s practical use, we also developed a supporting tool, named idelgen, that can be thought of as an application generator, based on the transformational programming paradigm and tailored to the instrumentation process. We illustrate the main concepts of our proposal with examples describing the instrumentation required in some traditional data flow testing criteria for C language.

RESULTS CONCERNING THINNESS OF D0L LANGUAGES

2000 ◽  
Vol 10 (02) ◽  
pp. 209-216
Author(s):  
JUHA HONKALA
Keyword(s):  
Algebraic Curves ◽  
Integral Points ◽  
Language L ◽  
Positive Genus

A language L is called thin if there exists an integer n0such that for all n≥n0L contains at most one word of length n. We show that thinness is decidable for exponential D0L languages. We show also that Siegel's result concerning integral points on algebraic curves of positive genus can often be used to prove that a polynomially bounded HD0L language is thin.

scholarly journals Language Equations for Maximal Decompositions in Coordination Control

2017 ◽  
Vol 50 (1) ◽  
pp. 13441-13446
Author(s):  
Jan Komenda ◽  
Feng Lin ◽  
Jan H. van Schuppen
Keyword(s):  
Coordination Control ◽  
Language Equations

The Semantic Truth Structure on the Language L of Predicate Logic

2022 ◽  
pp. 205-231
Author(s):  
Mircea Reghiş ◽  
Eugene Roventa
Keyword(s):  
Predicate Logic ◽  
Language L
Sign in / Sign up

Export Citation Format

Share Document