Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions
type: Item
instance of: scholarly article
title: Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions
zbMATH Open document ID: 1055.68068
DOI: 10.1016/S0022-0000(03)00036-9
author: Viliam Geffert
published in: Journal of Computer and System Sciences
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1967142
zbMATH Keywords: Formal languages
zbMATH Keywords: Descriptional complexity
zbMATH Keywords: Regular languages
zbMATH Keywords: Finite-state automata
zbMATH Keywords: Regular expressions
MaRDI profile type: Publication
cites work: Ambiguity in Graphs and Expressions
cites work: Complexity measures for regular expressions
cites work: Q5180413
cites work: Q5592246
cites work: Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
cites work: Optimal simulations between unary automata
cites work: Q4040284
description: scientific article; zbMATH DE number 1967142