Results 261 to 270 of about 1,001,632 (316)
Some of the next articles are maybe not open access.
Cybernetics and Systems Analysis, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Letichevskij, A. A. +4 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Letichevskij, A. A. +4 more
openaire +2 more sources
IEEE Transactions on Computers, 1985
The problem of inserting an item in a list is frequently encountered in various application fields such as sorting, compiling, etc. It is shown that the insertion of an item in a list of N members may be realized at a cost proportional to N and within a delay proportional to log N.
Marc Davio, Christian Ronse
openaire +1 more source
The problem of inserting an item in a list is frequently encountered in various application fields such as sorting, compiling, etc. It is shown that the insertion of an item in a list of N members may be realized at a cost proportional to N and within a delay proportional to log N.
Marc Davio, Christian Ronse
openaire +1 more source
2011
In this paper we consider an operation of inserting contexts in a word controlled by a contextual scheme X which provides a selection criterion for contextual insertion. We say that a language L is k-stable w.r.t. a contextual scheme X if by making any k context insertions in a word of L we still obtain a word of L; L is k-anti-stable w.r.t.
BOTTONI, Paolo Gaspare +4 more
openaire +2 more sources
In this paper we consider an operation of inserting contexts in a word controlled by a contextual scheme X which provides a selection criterion for contextual insertion. We say that a language L is k-stable w.r.t. a contextual scheme X if by making any k context insertions in a word of L we still obtain a word of L; L is k-anti-stable w.r.t.
BOTTONI, Paolo Gaspare +4 more
openaire +2 more sources
Proceedings of the 22nd European Conference on Pattern Languages of Programs, 2017
Insertion Spaces is the idea of purposefully leaving out empty space between objects to anticipate changes and insertions. These empty spaces can be used to insert further objects or rearrange existing objects. This idea is applicable in many contexts, but in this paper the context of software development and database development is addressed ...
Michael Krisper +3 more
openaire +1 more source
Insertion Spaces is the idea of purposefully leaving out empty space between objects to anticipate changes and insertions. These empty spaces can be used to insert further objects or rearrange existing objects. This idea is applicable in many contexts, but in this paper the context of software development and database development is addressed ...
Michael Krisper +3 more
openaire +1 more source
Information Sciences, 1983
The operations of insertion (\(\leftarrow)\) and iterated insertion (\(\leftarrow *)\) are variants of Kleene's operations \(\cdot\) and *. For languages S and T, \(S\leftarrow T=\{xzy:xy\in S\quad and\quad z\in T\}\) and \(S\leftarrow *=\{\lambda \}\cup S\cup S\leftarrow S\cup...\) (where \(\lambda\) is the empty word).
openaire +2 more sources
The operations of insertion (\(\leftarrow)\) and iterated insertion (\(\leftarrow *)\) are variants of Kleene's operations \(\cdot\) and *. For languages S and T, \(S\leftarrow T=\{xzy:xy\in S\quad and\quad z\in T\}\) and \(S\leftarrow *=\{\lambda \}\cup S\cup S\leftarrow S\cup...\) (where \(\lambda\) is the empty word).
openaire +2 more sources
International Journal of Foundations of Computer Science, 2016
It is well known that the resulting language obtained by inserting a regular language to a regular language is regular. We study the nondeterministic and deterministic state complexity of the insertion operation. Given two incomplete DFAs of sizes m and n, we give an upper bound (m+2)·2mn−m−1·3m and find a lower bound for an asymp-totically tight ...
Yo-Sub Han +3 more
openaire +2 more sources
It is well known that the resulting language obtained by inserting a regular language to a regular language is regular. We study the nondeterministic and deterministic state complexity of the insertion operation. Given two incomplete DFAs of sizes m and n, we give an upper bound (m+2)·2mn−m−1·3m and find a lower bound for an asymp-totically tight ...
Yo-Sub Han +3 more
openaire +2 more sources
Insertional Achilles Tendinopathy
Foot and Ankle Clinics, 2005There has been significant progress in our understanding of Achilles insertional tendinopathy since Clain and Baxter divided Achilles tendon disorders into noninsertional and insertional tendinopathy in 1992. In this article we specifically concentrate on Achilles insertional tendinopathy. Classically, overuse and poor training habits are considered to
Krishna Sayana M, MAFFULLI, Nicola
openaire +4 more sources
ON THE AMBIGUITY OF INSERTION SYSTEMS
International Journal of Foundations of Computer Science, 2011Gene insertion and deletion are the operations that occur commonly in DNA processing and RNA editing. Based on these evolutionary transformations, a computing model has been formulated in formal language theory known as insertion-deletion systems. In this paper, we study about the ambiguity issues of insertion systems.
Lakshmanan Kuppusamy +2 more
openaire +1 more source