Results 11 to 20 of about 540 (53)

Regular Cost Functions, Part I: Logic and Algebra over Words [PDF]

open access: yes, 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]

open access: yes, 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]

open access: yes, 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

The Height of Piecewise-Testable Languages with Applications in Logical Complexity [PDF]

open access: yes, 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

Automata for Unordered Trees [PDF]

open access: yes, 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

Towards a Uniform Theory of Effectful State Machines

open access: yes, 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

Tropical time series, iterated-sum signatures and quasisymmetric functions [PDF]

open access: yes, 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]

open access: yes
International ...
Carlos, Martin-Vide   +3 more
core   +1 more source

Set Unification

open access: yes, 2005
The unification problem in algebras capable of describing sets has been tackled, directly or indirectly, by many researchers and it finds important applications in various research areas--e.g., deductive databases, theorem proving, static analysis, rapid
Dovier, Agostino   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy