Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 4

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: combinatorics

Sortuj według:

Ogranicz wyniki do:

Araucaria Trees: Construction and Grafting Theorems

100%

Schmitt D. , Spehner J.-C.

tom Vol. 123, nr 4

417--445

Araucarias have been introduced by Schott and Spehner as trees which appear in the minimal automaton of the shuffle of words. We give here a new definition of araucarias which is more constructive and we prove that our definition of araucarias is equivalent to the original one. From the new definition we derive an optimal algorithm for the construction of araucarias and a new method for calculating their size. Moreover we characterize araucarias by properties of their maximal paths, by associating a capacity to every edge. We then show that every araucaria can be obtained by grafting and merging smaller araucarias. We prove also that every directed tree can be embedded in an araucaria. Moreover we define a capacity for every vertex of an araucaria, which leads to different new enumeration formulas for araucarias.

Epichristoffel Words and Minimization of Moore Automata

86%

Castiglione G. , Sciortino M.

tom Vol. 134, nr 3/4

319--333

This paper is focused on the connection between the combinatorics of words and minimization of automata. The three main ingredients are the epichristoffel words, Moore automata and a variant of Hopcroft’s algorithm for their minimization. Epichristoffel words defined in [14] generalize some properties of circular sturmian words. Here we prove a factorization property and the existence of the reduction tree, that uniquely identifies the structure of the word. Furthermore, in the paper we investigate the problem of the minimization of Moore automata by defining a variant of Hopcroft’s minimization algorithm. The use of this variant makes simpler the computation of the running time and consequently the study of families of automata that represent the extremal cases of the minimization process. Indeed, such a variant allows to use the above mentioned factorization property of the epichristoffel words and their reduction trees in order to find an infinite family of Moore automata such that the execution of the algorithm is uniquely determined and tight.

Permutacja newrozy i bezdogmatyzmu w polskiej literaturze najnowszej (wybrane przykłady)

72%

Ujma M.

tom 13

nr 3

88-101

The subject of the article are cultural permutations recurring in the literature: neurosis and without-dogma personality. The subject of the research were three novels published in 2017: #upał by Michał Olszewski, Lata powyżej zera by Anna Cieplak and Wzgórze psów by Jakub Żulczyk. The author presented – on the margin of the analysis and interpretation of the novel – the combinatorial method of reading literature, the main research interest in this method is to look for accumulating in literature and culture permutations.

W artykule podjęto temat powracających w literaturze permutacji kulturowych: newrozy i bezdogmatyzmu. Przedmiotem badań uczyniono trzy powieści wydane w 2017 roku: #upał Michała Olszewskiego, Lata powyżej zera Anny Cieplak oraz Wzgórze psów Jakuba Żulczyka. Na marginesie analizy i interpretacji powieści przedstawiono kombinatoryczną metodę czytania literatury, głównym jej przedmiotem zainteresowania czyniąc poszukiwania nawracających w literaturze i kulturze permutacji.

Combinatorial Testing of Context Aware Android Applications

72%

Piparia S. , Adamo D. , Bryce R. , Do H. , Bryant B.

tom Vol. 25

17--26

Mobile devices such as smart phones and smart watches utilize apps that run in context aware environments and must respond to context changes such as changes in network connectivity, battery level, screen orientation, and more. The large number of GUI events and context events often complicate the testing process. This work expands the AutoDroid tool to automatically generate tests that are guided by PairwiseInterleaved coverage of GUI event and context event sequences. We systematically weave context and GUI events into testing using the pairwise interleaved algorithm. The results show that the pairwise interleaved algorithm achieves up to five times higher code coverage compared to a technique that generates test suites in a single predefined context (without interleaving context and GUI events), a technique that changes the context at the beginning of each test case (without interleaving context and GUI events), and Monkey-Context-GUI (which randomly chooses context and GUI events). Future work will expand this strategy to include more context variables and test emerging technologies such as IoT and autonomous vehicles.