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, Košice, Slovakia 04154;Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Milano, Italy 20135;Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Milano, Italy 20135
Venue:
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Year:
2008

Citing 10
Cited 2

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

An automata-theoretic characterization of the chomsky-hierarchy

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Removing nondeterminism in constant height pushdown automata

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

Quantified Score

Hi-index	0.00

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.