On Upper and Lower Bounds on the Length of Alternating Towers

  title={On Upper and Lower Bounds on the Length of Alternating Towers},
  author={Stepan Holub and Galina Jir{\'a}skov{\'a} and Tomas Masopust},
A tower between two regular languages is a sequence of strings such that all strings on odd positions belong to one of the languages, all strings on even positions belong to the other language, and each string can be embedded into the next string in the sequence. It is known that if there are towers of any length, then there also exists an infinite tower. We investigate upper and lower bounds on the length of finite towers between two regular languages with respect to the size of the automata… 

On the Height of Towers of Subsequences and Prefixes

Alternating Towers and Piecewise Testable Separators

The complexity of a particular method to compute a piecewise testable separator is investigated, it is shown that it is closely related to the height of maximal finite towers, and the upper and lower bounds with respect to the size of the given nondeterministic automata are provided.

On the Complexity of k-Piecewise Testability and the Depth of Automata

It is shown that the upper bound on k given by the depth of the minimal DFA can be exponentially bigger than the minimal possible k, and the complexity bound and detailed analysis for small k’s are provided.

Separability by Short Subsequences and Subwords

The complexity of separability of regular languages by combinations of subsequences or subwords of a given length k is studied, so that the parameter k can be used to influence the size and simplicity of the separator.

Deciding Universality of ptNFAs is PSpace-Complete

It is shown, using a novel and nontrivial construction, that the universality problem for ptNFAs is PSpace-complete if the alphabet may grow polynomially.

A combinatorial approach to the separation problem for regular languages. (Une approche combinatoire du problème de séparation pour les langages réguliers)

This thesis provides a generic approach, based on combinatorial arguments, to proving the decidability of the separation problem for several subclasses of the regular languages, including the classes of piecewise testable languages, unambiguous languages, and locally (threshold) testable Languages.

Piecewise Testable Languages and Nondeterministic Automata

This paper defines a class of NFAs, called ptNFAs, that recognize piecewise testable languages and shows that the depth of a ptNFA provides an (up to exponentially better) upper bound on k than the minimal DFA.

F L ] 4 D ec 2 01 4 On k-piecewise testability ( preliminary report )

This work provides the complexity bound to decide whether a given minimal DFA represents a k-piecewise testable language for a fixed k, which then results in an algorithm that is single exponential with respect to the size of the DFA and d ouble exponential withrespect to the resulting k.

On $k$-piecewise testability (preliminary report)

It is shown that the upper bound on $k$ given by the depth of the minimal DFA can be exponentially bigger than the minimal possible $k$, and a tight upper bound is provided on thedepth of the minimum DFA recognizing a piecewise testable language.

Technical report column

A simple proof that AND-compression of NP-complete problems is hard is hard and can be found in this paper.



On the State Complexity of Closures and Interiors of Regular Languages with Subwords

The state complexity of the set of subwords and superwords of regular languages is studied, and a matching doubly-exponential lower bound for downward interiors in the case of an unbounded alphabet is proved.

Separating regular languages with first-order logic

It is proved that in order to answer the decision problem: given two regular input languages of finite words, decide whether there exists a first-order definable separator, sufficient information can be extracted from semigroups recognizing the input languages, using a fixpoint computation.

Separating Regular Languages by Piecewise Testable and Unambiguous Languages

A Ptime algorithm is given to check whether two given regular languages are separable by a piecewise testable language, that is, whether a \(\mathcal{B}\Sigma_1(<) sentence can witness that the languages are disjoint.

Efficient Separability of Regular Languages by Subsequences and Suffixes

This work gives characterizations of when two languages can be separated and presents an overview of when these problems can be decided in polynomial time if K and L are given by nondeterministic automata.

Finite Semigroups and Universal Algebra

Part 1 Finite universal algebra: elements of universal algebra order and topology finite algebras decidability. Part 2 Finite semigroups and monoids: permutativity operators relating semigroups and

Characterizations of Some Classes of Regular Events

  • J. Stern
  • Mathematics
    Theor. Comput. Sci.
  • 1985

The Pseudovariety J is Hyperdecidable

The notion of hyperdecidability for a class of finite semigroups, which is closely connected to the notion of decidability, is defined and it is proved that the pseudovariety J of J-trivial semig groups is hyperdecidable.

Ordering by Divisibility in Abstract Algebras

Piecewise testable events

  • Imre Simon
  • Mathematics
    Automata Theory and Formal Languages
  • 1975