Optimal lower bounds on regular expression size using communication complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4962 LNCS, Issue , 2008, Pages 273-286

  Gruber, Hermann ^a   Johannsen, Jan ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CONTROL THEORY; FINITE AUTOMATA; MILITARY DATA PROCESSING;

COMMUNICATION COMPLEXITIES; COMPUTATIONAL STRUCTURES; DETERMINISTIC FINITE AUTOMATA (DFA); EUROPEAN; INTERNATIONAL (CO); LOWER BOUNDS; REGULAR EXPRESSIONS; SOFTWARE SCIENCE;

FOUNDATIONS;

EID: 47249094173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78499-9_20     Document Type: Conference Paper

References (21)

1. Delgado, M., Morais, J.: Approximation to the smallest regular expression for a given regular language. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 312-314. Springer, Heidelberg (2005)
2. Ehrenfeucht, A., Zeiger, H.P.: Complexity measures for regular expressions. Journal of Computer and System Sciences 12(2), 134-146 (1976)
3. Ellul, K., Krawetz, B., Shallit, J., Wang, M.: Regular Expressions: New Results and Open Problems. Journal of Automata, Languages and Combinatorics 10(4), 407-437 (2005)
4. Grigni, M., Sipser, M.: Monotone separation of logarithmic space from logarithmic depth. Journal of Computer and System Sciences 50, 433-437 (1995)
5. Gruber, H., Holzer, M.: Finite automata, digraph connectivity and regular expression size. Technical report, Technische Universität München (December 2007)
6. Han, Y., Wood, D.: Obtaining shorter regular expressions from finite-state automata. Theoretical Computer Science 370(1-3), 110-120 (2007)
7. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
8. Karchmer, M., Wigderson, A.: Monotone circuits for connectivity require superlogarithmic depth. SIAM Journal on Discrete Mathematics 3, 255-265 (1990)
9. Khrapchenko, V.M.: Methods for determining lower bounds for the complexity of π-schemes (English translation). Math. Notes Acad. Sciences USSR 10, 474-479 (1972)
10. Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, Annals of Mathematics Studies, pp. 3-42. Princeton University Press, Princeton (1956)
11. Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, New York (1997)
12. Lee, T.: A new rank technique for formula size lower bounds. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, Springer, Heidelberg (2007)
13. Martinez, A.: Efficient computation of regular expressions from unary NFAs. In: Dassow, J., Hoeberechts, M., Jürgensen, H., Wotschke, D. (eds.) Workshop on Descriptional Complexity of Formal Systems 2002, London, Canada, pp. 216-230 (2002)
14. McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRA Transactions on Electronic Computers 9(1), 39-47 (1960)
15. Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: IEEE Symposium on Switching and Automata Theory 1971, pp. 188-191 (1971)
16. Morais, J.J., Moreira, N., Reis, R.: Acyclic automata with easy-to-find short regular expressions. In: Farré, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 349-350. Springer, Heidelberg (2006)
17. Morris, P.H., Gray, R.A., Filman, R.E.: Goto removal based on regular expressions. Journal of Software Maintenance 9(1), 47-66 (1997)
18. Sakarovitch, J.: The language, the expression, and the (small) automaton. In: Farré, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 15-30. Springer, Heidelberg (2006)
19. Salomaa, A.: Two complete axiom systems for the algebra of regular events. Journal of the ACM 13(1), 158-169 (1966)
20. Schnitger, G.: Regular expressions and NFAs without ε-transitions. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 432-443. Springer, Heidelberg (2006)
21. Yu, S.: State complexity of finite and infinite regular languages. Bulletin of the EATCS 76, 142-152 (2002)