Search results for "Concatenation"

showing 6 items of 6 documents

Anti-powers in infinite words

2018

In combinatorics of words, a concatenation of $k$ consecutive equal blocks is called a power of order $k$. In this paper we take a different point of view and define an anti-power of order $k$ as a concatenation of $k$ consecutive pairwise distinct blocks of the same length. As a main result, we show that every infinite word contains powers of any order or anti-powers of any order. That is, the existence of powers or anti-powers is an unavoidable regularity. Indeed, we prove a stronger result, which relates the density of anti-powers to the existence of a factor that occurs with arbitrary exponent. As a consequence, we show that in every aperiodic uniformly recurrent word, anti-powers of ev…

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)ConcatenationComputer Science - Formal Languages and Automata Theory68R150102 computer and information sciences01 natural sciencesTheoretical Computer ScienceCombinatoricsUnavoidable regularityPosition (vector)Infinite wordAvoidability[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: MathematicsMathematics - CombinatoricsDiscrete Mathematics and CombinatoricsOrder (group theory)Point (geometry)0101 mathematicsDiscrete Mathematics and CombinatoricMathematicsDiscrete mathematics000 Computer science knowledge general worksAnti-power010101 applied mathematicsComputational Theory and Mathematics010201 computation theory & mathematicsAperiodic graphComputer ScienceExponentPairwise comparisonCombinatorics (math.CO)SoftwareWord (group theory)Computer Science - Discrete Mathematics
researchProduct

Foundations for the formalization of metamathematics and axiomatizations of consequence theories

2004

Abstract This paper deals with Tarski's first axiomatic presentations of the syntax of deductive system. Andrzej Grzegorczyk's significant results which laid the foundations for the formalization of metalogic, are touched upon briefly. The results relate to Tarski's theory of concatenation, also called the theory of strings, and to Tarski's ideas on the formalization of metamathematics. There is a short mention of author's research in the field. The main part of the paper surveys research on the theory of deductive systems initiated by Tarski, in particular research on (i) the axiomatization of the general notion of consequence operation, (ii) axiom systems for the theories of classic conse…

Formalization of metamathematicsLogicConcatenationMetamathematicsField (mathematics)DUAL (cognitive architecture)Characterization (mathematics)Rejection consequenceSyntax (logic)MetalogicAlgebraMathematics::LogicComputer Science::Logic in Computer ScienceTheory of deductive systemsClassic and nonclassic consequencesMathematical economicsAxiomMathematicsAnnals of Pure and Applied Logic
researchProduct

Concatenated logic functions using nanofluidic diodes with all-electrical inputs and outputs

2018

[EN] Nanopore-based logical schemes in ionic solutions typically involve single gates and chemical inputs. The design of computer-like functions requires the consecutive concatenation of several gates and the use of electrical potentials and currents to facilitate the downstream transfer of electrochemical information. We have demonstrated the robust operation of concatenated logic functions using biomimetic nanofluidic diodes based on single pore membranes. To this end, we have implemented first the logic functions AND and OR with combinations of single nanopores using all-electrical input and output signals. The concatenation of these gates allows the output of the OR gate to act as one o…

OR gateComputer scienceConcatenation02 engineering and technologySignal transduction010402 general chemistry01 natural sciencesSignallaw.inventionlcsh:ChemistrylawElectrochemistryElectronic engineeringHardware_ARITHMETICANDLOGICSTRUCTURESElectronic circuitTransistor021001 nanoscience & nanotechnology0104 chemical sciencesNanofluidic diodelcsh:Industrial electrochemistrylcsh:QD1-999FISICA APLICADAElectrochemical logic functionsInverter0210 nano-technologyAND gatelcsh:TP250-261Hardware_LOGICDESIGNNOR gateElectrochemistry Communications
researchProduct

Diagonal space time hadamard codes with erasure decoding algorithm

2005

A major challenge in the area of space time (ST) codes is to find codes suitable for efficient decoding, thus overcoming the problem of many existing ST code designs which require maximum-likelihood (ML) decoding. A solution could be to apply single-input single-output (SISO) channel codes and theory over temporal channel fading to the multi-input single-output (MISO) code construction and classical suboptimum decoding methods. For these purposes, an ST code construction which allows the use of efficient decoding algorithms is described. We propose a concatenated code, where the inner code is the diagonal ST Hadamard (D-STH) code with Paley constructions and the outer code is an algebraic b…

Prefix codeBlock codePolynomial codeComputer scienceConcatenationList decodingData_CODINGANDINFORMATIONTHEORYSequential decodingLocally testable codeSystematic codeReed–Solomon error correctionHadamard transformCyclic codeFadingLow-density parity-check codeComputer Science::Information TheorySelf-synchronizing codeHadamard codeConcatenated error correction codeReed–Muller codeSerial concatenated convolutional codesAntenna diversityLinear codeConvolutional codeErasureConstant-weight codeErasure codeAlgorithmDecoding methodsCommunication channelIEEE Wireless Communications and Networking Conference, 2005
researchProduct

Words with the Maximum Number of Abelian Squares

2015

An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain \(\varTheta (n^2)\) distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length n grows quadratically with n.

Quadratic growthComputer Science (all)ConcatenationComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Computer Science (all); Theoretical Computer ScienceSquare (algebra)Theoretical Computer ScienceCombinatoricsAnagramsIrrational numberGolden ratioAbelian groupComputer Science::Formal Languages and Automata TheoryWord (group theory)Mathematics
researchProduct

Abelian antipowers in infinite words

2019

Abstract An abelian antipower of order k (or simply an abelian k-antipower) is a concatenation of k consecutive words of the same length having pairwise distinct Parikh vectors. This definition generalizes to the abelian setting the notion of a k-antipower, as introduced in Fici et al. (2018) [7] , that is a concatenation of k pairwise distinct words of the same length. We aim to study whether a word contains abelian k-antipowers for arbitrarily large k. S. Holub proved that all paperfolding words contain abelian powers of every order (Holub, 2013 [8] ). We show that they also contain abelian antipowers of every order.

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniSierpiǹski wordSettore INF/01 - InformaticaApplied MathematicsConcatenationAbelian complexityCombinatoricsArbitrarily largeOrder (group theory)Pairwise comparisonk-antipowerAbelian groupPaperfolding wordComputer Science::Formal Languages and Automata TheoryWord (group theory)Abelian antipowerMathematicsAdvances in Applied Mathematics
researchProduct