More concise representation of regular languages by automata and regular expressions
type: Item
instance of: scholarly article
title: More concise representation of regular languages by automata and regular expressions
zbMATH Open document ID: 1192.68409
author: Viliam Geffert
author: Carlo Mereghetti
author: Beatrice Palano
published in: Information and Computation
publication date: 2010-04-08T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5690789
zbMATH Keywords: pushdown automata
zbMATH Keywords: regular expressions
zbMATH Keywords: straight line programs
zbMATH Keywords: descriptional complexity
describes a project that uses: LANGAGE
MaRDI profile type: Publication
full work available at URL: j.ic.2010.01.002
OpenAlex ID: W2029153962
cites work: Q4773298
cites work: Regular expressions into finite automata
cites work: Characterization of Glushkov automata
cites work: Alternation
cites work: Complexity measures for regular expressions
cites work: Provably Shorter Regular Expressions from Deterministic Finite Automata
cites work: Q4506483
cites work: Probabilistic automata
cites work: Q5541339
cites work: Q5541340
cites work: Regularity and Related Problems for Deterministic Pushdown Automata
DOI: 10.1016/J.IC.2010.01.002
description: scientific article; zbMATH DE number 5690789