Results 1 to 10 of about 503 (42)
Regular Cost Functions, Part I: Logic and Algebra over Words [PDF]
, 2013 The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to each input the ...
Colcombet, Thomas
core +2 more sources
Groups whose word problems are not semilinear [PDF]
, 2018 Suppose that G is a finitely generated group and W is the formal language of words defining the identity in G. We prove that if G is a nilpotent group, the fundamental group of a finite volume hyperbolic three-manifold, or a right-angled Artin group ...
Gilman, Robert H. +2 more
core +2 more sources
Infinite Games with Uncertain Moves [PDF]
, 2013 International audienceWe study infinite two-player games where one of the players is unsure about the set of moves available to the other player. In particular, the set of moves of the other player is a strict superset of what she assumes it to be.
Aniello Murano +13 more
core +4 more sources
Security and Communication Networks, Volume 2019, Issue 1, 2019., 2019 The main purpose of this paper is to introduce stream ciphers with the nonbijective encryption function of multivariate nature constructed in terms of algebraic graph theory. More precisely, we describe the two main symmetric algorithms for creation of multivariate encryption transformations based on three families of bipartite graphs with partition ...
Vasyl Ustimenko +5 more
wiley +1 more source
The Height of Piecewise-Testable Languages with Applications in Logical Complexity [PDF]
, 2016 The height of a piecewise-testable language L is the maximum length of the words needed to define L by excluding and requiring given subwords. The height of L is an important descriptive complexity measure that has not yet been investigated in a ...
Karandikar, Prateek +1 more
core +1 more source
a review of Bimonoids for hyperplane arrangements by Aguiar Marcelo; Mahajan Swapneel [PDF]
, 2023 articl
NISHIMURA Hirokazu
core
Towards a Uniform Theory of Effectful State Machines
, 2020 Using recent developments in coalgebraic and monad-based semantics, we present a uniform study of various notions of machines, e.g. finite state machines, multi-stack machines, Turing machines, valence automata, and weighted automata.
Goncharov, Sergey +2 more
core +2 more sources
Automata for Unordered Trees [PDF]
, 2016 International audienceWe present a framework for defining automata for unordereddata trees that is parametrized by the way in which multisets of children nodes are described.
Boiret, Adrien +3 more
core +4 more sources
Tropical time series, iterated-sum signatures and quasisymmetric functions [PDF]
, 2020 Driven by the need for principled extraction of features from time series, we introduce the iterated-sums signature over any commutative semiring. The case of the tropical semiring is a central, and our motivating, example, as it leads to features of ...
Diehl, Joscha +2 more
core +2 more sources
Language and Automata Theory and Applications [PDF]
International ...
Carlos, Martin-Vide +3 more
core +1 more source