117,583 research outputs found
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
A language over an alphabet is suffix-convex if, for any words
, whenever and are in , then so is .
Suffix-convex languages include three special cases: left-ideal, suffix-closed,
and suffix-free languages. We examine complexity properties of these three
special classes of suffix-convex regular languages. In particular, we study the
quotient/state complexity of boolean operations, product (concatenation), star,
and reversal on these languages, as well as the size of their syntactic
semigroups, and the quotient complexity of their atoms.Comment: 20 pages, 11 figures, 1 table. arXiv admin note: text overlap with
arXiv:1605.0669
Merging two Hierarchies of Internal Contextual Grammars with Subregular Selection
In this paper, we continue the research on the power of contextual grammars
with selection languages from subfamilies of the family of regular languages.
In the past, two independent hierarchies have been obtained for external and
internal contextual grammars, one based on selection languages defined by
structural properties (finite, monoidal, nilpotent, combinational, definite,
ordered, non-counting, power-separating, suffix-closed, commutative, circular,
or union-free languages), the other one based on selection languages defined by
resources (number of non-terminal symbols, production rules, or states needed
for generating or accepting them). In a previous paper, the language families
of these hierarchies for external contextual grammars were compared and the
hierarchies merged. In the present paper, we compare the language families of
these hierarchies for internal contextual grammars and merge these hierarchies.Comment: In Proceedings NCMA 2023, arXiv:2309.07333. arXiv admin note: text
overlap with arXiv:2309.02768, arXiv:2208.1472
The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete
A classic result by Stockmeyer gives a non-elementary lower bound to the
emptiness problem for star-free generalized regular expressions. This result is
intimately connected to the satisfiability problem for interval temporal logic,
notably for formulas that make use of the so-called chop operator. Such an
operator can indeed be interpreted as the inverse of the concatenation
operation on regular languages, and this correspondence enables reductions
between non-emptiness of star-free generalized regular expressions and
satisfiability of formulas of the interval temporal logic of chop under the
homogeneity assumption. In this paper, we study the complexity of the
satisfiability problem for suitable weakenings of the chop interval temporal
logic, that can be equivalently viewed as fragments of Halpern and Shoham
interval logic. We first consider the logic featuring
modalities , for \emph{begins}, corresponding to the prefix relation on
pairs of intervals, and , for \emph{during}, corresponding to the infix
relation. The homogeneous models of naturally correspond to
languages defined by restricted forms of regular expressions, that use union,
complementation, and the inverses of the prefix and infix relations. Such a
fragment has been recently shown to be PSPACE-complete . In this paper, we
study the extension with the temporal neighborhood modality
(corresponding to the Allen relation \emph{Meets}), and prove that it
increases both its expressiveness and complexity. In particular, we show that
the resulting logic is EXPSPACE-complete.Comment: arXiv admin note: substantial text overlap with arXiv:2109.0832
A Categorical Approach to Syntactic Monoids
The syntactic monoid of a language is generalized to the level of a symmetric
monoidal closed category . This allows for a uniform treatment of
several notions of syntactic algebras known in the literature, including the
syntactic monoids of Rabin and Scott ( sets), the syntactic
ordered monoids of Pin ( posets), the syntactic semirings of
Pol\'ak ( semilattices), and the syntactic associative algebras of
Reutenauer ( = vector spaces). Assuming that is a
commutative variety of algebras or ordered algebras, we prove that the
syntactic -monoid of a language can be constructed as a
quotient of a free -monoid modulo the syntactic congruence of ,
and that it is isomorphic to the transition -monoid of the minimal
automaton for in . Furthermore, in the case where the variety
is locally finite, we characterize the regular languages as
precisely the languages with finite syntactic -monoids.Comment: arXiv admin note: substantial text overlap with arXiv:1504.0269
Small overlap monoids II: automatic structures and normal forms
We show that any finite monoid or semigroup presentation satisfying the small
overlap condition C(4) has word problem which is a deterministic rational
relation. It follows that the set of lexicographically minimal words forms a
regular language of normal forms, and that these normal forms can be computed
in linear time. We also deduce that C(4) monoids and semigroups are rational
(in the sense of Sakarovitch), asynchronous automatic, and word hyperbolic (in
the sense of Duncan and Gilman). From this it follows that C(4) monoids satisfy
analogues of Kleene's theorem, and admit decision algorithms for the rational
subset and finitely generated submonoid membership problems. We also prove some
automata-theoretic results which may be of independent interest.Comment: 17 page
- …