More concise representation of regular languages by automata and regular expressions

Authors:
Viliam Geffert;Carlo Mereghetti;Beatrice Palano
Affiliations:
Department of Computer Science, P. J. Šafárik University, Jesenná 5, 04154 Košice, Slovakia;Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, via Comelico 39, 20135 Milano, Italy;Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, via Comelico 39, 20135 Milano, Italy
Venue:
Information and Computation
Year:
2010

Citing 10
Cited 6

Regular expressions into finite automata

Theoretical Computer Science
Regularity and Related Problems for Deterministic Pushdown Automata

Journal of the ACM (JACM)
Alternation

Journal of the ACM (JACM)
Characterization of Glushkov automata

Theoretical Computer Science
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Economy of description by automata, grammars, and formal systems

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Finite automata and their decision problems

IBM Journal of Research and Development
The reduction of two-way automata to one-way automata

IBM Journal of Research and Development
Complexity measures for regular expressions

Journal of Computer and System Sciences

The size-cost of Boolean operations on constant height deterministic pushdown automata

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Descriptional complexity of two-way pushdown automata with restricted head reversals

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
The size-cost of Boolean operations on constant height deterministic pushdown automata

Theoretical Computer Science
Descriptional complexity of two-way pushdown automata with restricted head reversals

Theoretical Computer Science
A note on controllability of deterministic context-free systems

Automatica (Journal of IFAC)
Descriptional complexity of pushdown store languages

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems

Quantified Score

Hi-index	0.05

Visualization

Abstract

We consider two formalisms for representing regular languages: constant height pushdown automata and straight line programs for regular expressions. We constructively prove that their sizes are polynomially related. Comparing them with the sizes of finite state automata and regular expressions, we obtain optimal exponential and double exponential gaps, i.e., a more concise representation of regular languages.