Representations of Circular Words

In this article we give two different ways of representations of circular words. Representations with tuples are intended as a compact notation, while representations with trees give a way to easily process all conjugates of a word. The latter form can also be used as a graphical representation of periodic properties of finite (in some cases, infinite) words. We also define iterative representations which can be seen as an encoding utilizing the flexible properties of circular words. Every word over the two letter alphabet can be constructed starting from ab by applying the fractional power and the cyclic shift operators one after the other, iteratively.Comment: In Proceedings AFL 2014, arXiv:1405.527

A turisztikai helymarketing Székelyföldön - az imázs- és márkahasználat tudományos megalapozása

19

State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters

Deterministic and nondeterministic finite automata with translucent letters were introduced by Nagy and Otto more than a decade ago as Cooperative Distributed systems of a kind of stateless restarting automata with window size one. These finite state machines have a surprisingly large expressive power: all commutative semi-linear languages and all rational trace languages can be accepted by them including various not context-free languages. While the nondeterministic variant defines a language class with nice closure properties, the deterministic variant is weaker, however it contains all regular languages, some non-regular context-free languages, as the Dyck language, and also some languages that are not even context-free. In all those models for each state, the letters of the alphabet could be in one of the following categories: the automaton cannot see the letter (it is translucent), there is a transition defined on the letter (maybe more than one transitions in nondeterministic case) or none of the above categories (the automaton gets stuck by seeing this letter at the given state and this computation is not accepting). State-deterministic automata are recent models, where the next state of the computation determined by the structure of the automata and it is independent of the processed letters. In this paper our aim is twofold, on the one hand, we investigate state-deterministic finite automata with translucent letters. These automata are specially restricted deterministic finite automata with translucent letters. In the other novel model we present, it is allowed that for a state the set of translucent letters and the set of letters for which transition is defined are not disjoint. One can interpret this fact that the automaton has a nondeterministic choice for each occurrence of such letters to see them (and then erase and make the transition) or not to see that occurrence at that time. Based on these semi-translucent letters, the expressive power of the automata increases, i.e., in this way a proper generalization of the previous models is obtained.Comment: In Proceedings AFL 2023, arXiv:2309.0112

SW-type puzzles and their graphs

In this paper, we present the SW-type of truth-tellers and liars puzzles. We examine the SW-type puzzles where each person can utter a sentence about the person's type and in which he uses only the "and" connective. We make the graphs of these puzzles. The graph of a puzzle has all information about the puzzle if we have no other information to solve the puzzle than the statements given (clear puzzles). We analyze the graphs of the possible puzzles. We give some transformations of graphs based on local information, for instance arrow-adding steps. These local steps are very helpful to solve these puzzles. We show an example that we can solve using these local steps. After this, we examine into the global properties of the graphs. We show a special example when the local steps do not help, but the puzzle is solvable by using global information. Finally we show a graph-algorithm which is a combination of local and global information, and show that it can solve the SW-type puzzles

Comparative analysis of two tech giants under the financial perspective: Microsoft versus Alphabet

Treballs Finals del Màster en Oficial en Empresa Internacional / International Business, Facultat d'Economia i Empresa, Universitat de Barcelona. Curs: 2020-2022. Tutor: Martí Sagarra GarciaThis paper provides a comparison of two key players in the IT industry, Microsoft and Alphabet, from a financial point of view. After analysing the IT industry and introducing the main theoretical concepts of the paper, the study gives a general overview of the two tech giants and compares their business models focusing on how they create and capture value. Furthermore, the case study includes a calculation of financial ratios using secondary data and explains the effect of the Coronavirus pandemic on the companies’ financial performance. Finally, their capital structure and their alleged anti-competitive actions are discussed, outlining two court cases of great importance and their consequences on stock prices

3D CNN Based Phantom Object Removing from Mobile Laser Scanning Data

In this paper we introduce a new deep learning based approach to detect and remove phantom objects from point clouds produced by mobile laser scanning (MLS) systems. The phantoms are caused by the presence of scene objects moving concurrently with the MLS platform, and appear as long, sparse but irregular point cloud segments in the measurements. We propose a new 3D CNN framework working on a voxelized column-grid to identify the phantom regions. We quantitatively evaluate the proposed model on real MLS test data, and compare it to two different reference approaches