论文信息 - Reversal on Regular Languages and Descriptional Complexity

Reversal on Regular Languages and Descriptional Complexity

We study the problem stated as follows: which values in the range from logn to 2 n may be obtained as the state complexity of the reverse of a regular language represented by a minimal deterministic automaton of n states? In the main result of this paper we use an alphabet of size 2n − 2 to show that the entire range of complexities may be produced for any n. This considerably improves an analogous result from the literature that uses an alphabet of size 2 n . We also provide some partial results for the case of a binary alphabet.

Juraj Sebej | Juraj Sebej

[1] J. Brzozowski. Canonical regular expressions and minimal state graphs for definite events , 1962 .

[2] Ernst L. Leiss,et al. Succint Representation of Regular Languages by Boolean Automata , 1981, Theor. Comput. Sci..

[3] Galina Jirásková,et al. On the State Complexity of Complements, Stars, and Reversals of Regular Languages , 2008, Developments in Language Theory.

[4] Viliam Geffert,et al. Magic numbers in the state hierarchy of finite automata , 2006, Inf. Comput..

[5] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[6] Mike Paterson,et al. A family of NFAs which need 2n- deterministic states , 2003, Theor. Comput. Sci..

[7] Yahiko Kambayashi,et al. Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs , 2000, Theor. Comput. Sci..

[8] Grzegorz Rozenberg,et al. Developments in Language Theory II , 2002 .

[9] Tomás Masopust,et al. Complexity in Union-Free Regular Languages , 2011, Int. J. Found. Comput. Sci..

[10] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.

[11] Juraj Sebej,et al. Reversal of binary regular languages , 2012, Theor. Comput. Sci..

[12] C. T. Leondes. Proceedings of the symposium on mathematical theory of Automata , 1964 .

[13] Galina Jirásková,et al. Magic Numbers and Ternary Alphabet , 2009, Int. J. Found. Comput. Sci..

[14] B. G. Mirkin,et al. On dual automata , 1966 .