Succinctness of regular expressions with interleaving, intersection and counting
type: Item
instance of: scholarly article
title: Succinctness of regular expressions with interleaving, intersection and counting
zbMATH Open document ID: 1192.68120
author: Wouter Gelade
published in: Theoretical Computer Science
publication date: 2010-07-07T00:00:00Z
full work available at URL: http://hdl.handle.net/1942/12824
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 5731743
zbMATH Keywords: regular expressions
zbMATH Keywords: succinctness
describes a project that uses: PERL
describes a project that uses: Relax NG
MaRDI profile type: Publication
OpenAlex ID: W1987660690
cites work: Regular expressions into finite automata
cites work: Rank-non-increasing transformations on transition graphs
cites work: Transition graphs and the star-height of regular events
cites work: Complexity measures for regular expressions
cites work: Q5437181
cites work: Q3888558
cites work: Q4910730
cites work: Finite Automata, Digraph Connectivity, and Regular Expression Size
cites work: Provably Shorter Regular Expressions from Deterministic Finite Automata
cites work: Tight Bounds on the Descriptional Complexity of Regular Expressions
cites work: Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
cites work: A note on the space complexity of some decision problems for finite automata
cites work: Q4708594
cites work: The loop complexity of pure-group events
cites work: Q4736867
cites work: The emptiness of complement problem for semi extended regular expressions requires \(c^n\) space
cites work: Q3416098
cites work: Q4131648
cites work: Q4500649
cites work: Q4714446
cites work: State complexity of regular languages
DOI: 10.1016/J.TCS.2010.04.036
description: scientific article; zbMATH DE number 5731743