Related papers: The state complexity of star-complement-star
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
The space-like asymptotic limit of the bilocal composite field of the state consisting of a nucleus and an electron is studied. It is shown that the resulting local field of an atom satisfies the proper commutation relations in the…
This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted…
The subsumption problem with respect to terminologies in the description logic ALC is EXPTIME-complete. We investigate the computational complexity of fragments of this problem by means of allowed Boolean operators. Hereto we make use of…
We propose a measure of learning efficiency for non-finite state spaces. We characterize the complexity of a learning problem by the metric entropy of its state space. We then describe how learning efficiency is determined by this measure…
Context-dependent semantic parsing has proven to be an important yet challenging task. To leverage the advances in context-independent semantic parsing, we propose to perform follow-up query analysis, aiming to restate context-dependent…
Consider $ A^* $, the free monoid generated by the finite alphabet $A$ with the concatenation operation. Two words have the same commutative image when one is a permutation of the symbols of the other. The commutative closure of a set $ L…
This paper introduces to the calculus of regular expressions a replace operator, ->, and defines a set of replacement expressions that concisely encode several alternate variations of the operation. The basic case is unconditional…
Given a metric space $(F \cup C, d)$, we consider star covers of $C$ with balanced loads. A star is a pair $(f, C_f)$ where $f \in F$ and $C_f \subseteq C$, and the load of a star is $\sum_{c \in C_f} d(f, c)$. In minimum load $k$-star…
We investigate the complexity of a puzzle that turns out to be NL-complete.
We study the structure of relativistic stars in $\mathcal{R}+\alpha \mathcal{R}^{2}$ theory using the method of matched asymptotic expansion to handle the higher order derivatives in field equations arising from the higher order curvature…
The notion of Online State Complexity, introduced by Karp in 1967, quantifies the amount of states required to solve a given problem using an online algorithm, which is represented by a deterministic machine scanning the input from left to…
We propose a new doorway to study the interplay between equations of state of dense matter and compact stars in gauge/gravity correspondence. For this we construct a bulk geometry near the boundary of five-dimensional spacetime. By solving…
Sectional pseudocomplementation (sp-complementation) on a poset is a partial operation $*$ which associates with every pair $(x,y)$ of elements, where $x \ge y$, the pseudocomplement $x*y$ of $x$ in the upper section $[y)$. Any total…
The relativistic inverse stellar structure problem determines the equation of state of the stellar matter given a knowledge of suitable macroscopic observable properties (e.g. their masses and radii) of the stars composed of that material.…
We consider a set of natural operations on languages, and prove that the orbit of any language L under the monoid generated by this set is finite and bounded, independently of L. This generalizes previous results about complement, Kleene…
This article defines a complement of a function and conditions for existence of such a complement function and presents few algorithms to construct a complement.
Generalizing the notion of automatic complexity of individual strings due to Shallit and Wang, we define the automatic complexity $A(E)$ of an equivalence relation $E$ on a finite set $S$ of strings. We prove that the problem of determining…
We study the Constraint Satisfaction Problem CSP(A), where A is first-order definable in (Z;+,1) and contains +. We prove such problems are either in P or NP-complete.
Performance evolution of a number of complex scientific and technical systems demonstrate exponential progress with time exp(+t/C) . The speed of progress C - a measure of difficulty and complexity - is analyzed for high energy elementary…