Obtaining shorter regular expressions from finite-state automata
type: Item
instance of: scholarly article
title: Obtaining shorter regular expressions from finite-state automata
zbMATH Open document ID: 1118.68078
author: Yo-Sub Han
author: D. Wood
published in: Theoretical Computer Science
publication date: 2007-02-26T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5129786
zbMATH Keywords: regular languages
zbMATH Keywords: finite-state automata
zbMATH Keywords: state elimination
zbMATH Keywords: bridge states
zbMATH Keywords: vertical chopping
zbMATH Keywords: horizontal chopping
describes a project that uses: LANGAGE
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.09.025
OpenAlex ID: W2142662777
cites work: The validation of SGML content models
cites work: Boolean Matrices and the Stability of Neural Nets
cites work: Characterization of Glushkov automata
cites work: Introduction to algorithms
cites work: Implementation and Application of Automata
cites work: Q4079524
cites work: Deterministic generalized automata
cites work: A characterization of Thompson digraphs.
cites work: THE ABSTRACT THEORY OF AUTOMATA
cites work: STACS 2005
cites work: THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
cites work: Q4045961
cites work: Theory Is Forever
cites work: Follow automata.
cites work: Minimal NFA Problems are Hard
cites work: Q4671950
cites work: Q5536277
cites work: Programming Techniques: Regular expression search algorithm
cites work: Q4692941
DOI: 10.1016/J.TCS.2006.09.025
Recommended article: Implementation and Application of Automata
Recommended article: PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA
Recommended article: Short Regular Expressions from Finite Automata: Empirical Results
Recommended article: Provably Shorter Regular Expressions from Deterministic Finite Automata
Recommended article: Regular expressions into finite automata
Recommended article: Q4412097
Recommended article: From regular expressions to finite automata∗
Recommended article: An Optimal Construction of Finite Automata from Regular Expressions
Recommended article: From regular expressions to smaller NFAs
Recommended article: More Concise Representation of Regular Languages by Automata and Regular Expressions
description: scientific article; zbMATH DE number 5129786