# On the State Complexity of the Reverse of - and -Trivial Regular Languages

@inproceedings{Jirskov2013OnTS,
title={On the State Complexity of the Reverse of - and -Trivial Regular Languages},
author={Galina Jir{\'a}skov{\'a} and Tomas Masopust},
booktitle={DCFS},
year={2013}
}
• Published in DCFS 1 April 2013
• Computer Science, Mathematics
The tight bound on the state complexity of the reverse of $${\mathcal R}$$-trivial and $${\mathcal J}$$-trivial regular languages of the state complexity n is 2 n − 1. The witness is ternary for $${\mathcal R}$$-trivial regular languages and (n − 1)-ary for $${\mathcal J}$$-trivial regular languages. In this paper, we prove that the bound can be met neither by a binary $${\mathcal R}$$-trivial regular language nor by a $${\mathcal J}$$-trivial regular language over an (n − 2)-element alphabet…
4 Citations
Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages
• Linguistics, Computer Science
Acta Cybern.
• 2014
Tight upper bounds are found on the quotient complexity of intersection, union, difference, symmetric difference, concatenation, star, and reversal in these three classes of languages.
On Boolean combinations forming piecewise testable languages
• Mathematics, Linguistics
Theor. Comput. Sci.
• 2017
Syntactic Complexity of ℛ- and 풥-Trivial Regular Languages
• Linguistics, Computer Science
Int. J. Found. Comput. Sci.
• 2014
It is proved that n! and ⌊e(n − 1)⌋ are tight upper bounds for the syntactic complexity of ℛ- and 𝒥-trivial regular languages, respectively.
A Survey on Operational State Complexity
• Computer Science
J. Autom. Lang. Comb.
• 2017
In this survey, the state complexities of individual regularity preserving language operations on regular and some subregular languages are reviewed and the combination of individual operations are revisited.

## References

SHOWING 1-10 OF 22 REFERENCES
Syntactic Complexity of - and -Trivial Regular Languages
• Linguistics, Computer Science
DCFS
• 2013
It is proved that n! and $$\lfloor e(n-1)! \rfloor$$ are tight upper bounds for the syntactic complexity of $${mathcal R}$$- and $${\mathcal J}$$-trivial regular languages, respectively.
State Complexity of Basic Operations on Finite Languages
• Computer Science
WIA
• 1999
It is shown that the catenation of two finite languages accepted by an m- state and an n-state DFA, respectively, with m > n is accepted by a DFA of (m - n + 3)2n-2 - 1 states in the two-letter alphabet case, and this bound is shown to be reachable.
Regular Ideal Languages and Their Boolean Combinations
• Computer Science, Mathematics
CIAA
• 2012
It is shown that the above concepts can be adapted to these two-way automata such that the resulting languages are the right ideals, definable in twovariable first-order logic.
Complexity in Union-Free Regular Languages
• Computer Science
Developments in Language Theory
• 2010
It is proved that (deterministic) union-freeness of languages does not accelerate regular operations, except for the reversal in the nondeterministic case.
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
• Mathematics
CIAA
• 2012
It is shown that there exists a language accepted by an acyclic minimal D FA such that the minimal DFA for its reverse is exponential with respect to the number of states, and a tight bound is established on the state complexity of the reverse of acyClic DFAs.
Languages of R-Trivial Monoids
• Mathematics
J. Comput. Syst. Sci.
• 1980
Finite Automata
• D. Perrin
• Computer Science
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
• 1990