On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity

  title={On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity},
  author={Szabolcs Iv{\'a}n and Judit Nagy-Gy{\"o}rgy},
  journal={Acta Cybern.},
We give an upper bound of nn-1!-n-3! for the possible largestsize of a subsemigroup of the full transformational semigroup overn elements consisting only of nonpermutational transformations.As an application we gain the same upper bound for the syntacticcomplexity of generalized definite languages as well. 

Figures from this paper

Large Aperiodic Semigroups

This work searches for the largest syntactic semigroup of a star-free language having n left quotients of an aperiodic finite automaton with n states.

Syntactic Complexity of Circular Semi-Flower Automata

It is proved that the syntactic complexity of $n$-state CSFA with two bpis over a binary alphabet is $2n(n+1)$.

Syntactic Complexity of Bifix-Free Languages

It is proved that the cardinality of the syntactic semigroup of a bifix-free language with state complexity n is at most \((n-1)^{n-3}+(n-2)^{ n-3}) + (n- 3)2-1 - 1, which is the minimal size of the alphabet required to meet the bound for \(n \geqslant 6\).

Checking Whether an Automaton Is Monotonic Is NP-complete

It is proved that the problem of deciding whether a given automaton is monotonic is NP-complete, and the same result is obtained for oriented automata, whose states can be arranged in a cyclic order.



State complexity and the monoid of transformations of a finite set

Good upper and lower bounds are obtained on the state complexity of root(L) over alphabets of all sizes and an application is presented to the problem of 2DFA-DFA conversion.

Alternative Automata Characterization of Piecewise Testable Languages

It is proved that every piecewise testable language L is k-piecewiseTestable for k equal to the depth of the minimal DFA of L, which improves all previously known estimates of such k.

New problems complete for nondeterministic log space

Several problems are shown equivalent to reachability in undirected graphs, including bipartiteness and satisfiability of formulas with the “exclusive or” connective.

On isomorphic representations of generalized definite automata

The generalized definite automata are studied and systems which are isomorphically complete for this class with respect to the »¿-products are characterized.

About Some Properties of Definite, Reverse-Definite and Related Automata

  • A. Ginzburg
  • Mathematics
    IEEE Trans. Electron. Comput.
  • 1966
For reduced finite Moore automata corresponding to regular expressions, it is shown that an arbitrary change of the initial state or of the set of final states results in an automaton belonging to the same class.

Syntactic Complexity of Finite/Cofinite, Definite, and Reverse Definite Languages

We study the syntactic complexity of finite/cofinite, definite and reverse definite languages. The syntactic complexity of a class of languages is defined as the maximal size of syntactic semigroups

Syntactic Complexities of Nine Subclasses of Regular Languages

  • Baiyu Li
  • Linguistics, Computer Science
  • 2012
The syntactic complexity of suffix-, bifix-, and factor-free regular languages, star-free languages including three subclasses, and Rand J -trivial regular languages is studied, and upper bounds on the syntactic complexities of these classes of languages are found.

Complexity of Some Problems from the Theory of Automata

Piecewise and Local Threshold Testability of DFA

The necessary and sufficient conditions for an automaton to be locally threshold testable are found and the polynomial time algorithm and an algorithm of order O(n3) are introduced for the local threshold testability problem for syntactic semigroup of the automaton.