An efficient null-free procedure for deciding regular language membership
type: Item
instance of: scholarly article
title: An efficient null-free procedure for deciding regular language membership
zbMATH Open document ID: 0953.68074
DOI: 10.1016/S0304-3975(99)00019-5
published in: Theoretical Computer Science
publication date: 2000-08-23T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1495181
zbMATH Keywords: Glushkov automaton
author: Jean-Luc Ponty
describes a project that uses: AMoRE
MaRDI profile type: Publication
cites work: Q4385510
cites work: Efficient string matching
cites work: Q5452362
cites work: Partial derivatives of regular expressions and finite automaton constructions
cites work: From regular expressions to deterministic automata
cites work: Regular expressions into finite automata
cites work: Deterministic regular languages
cites work: THE ABSTRACT THEORY OF AUTOMATA
cites work: On Simon's string searching algorithm
cites work: Q5592246
cites work: Translating regular expressions into small ε-free nondeterministic finite automata
cites work: Automata Studies. (AM-34)
cites work: Fast Pattern Matching in Strings
cites work: Q3999156
cites work: Q4077455
cites work: Programming Techniques: Regular expression search algorithm
cites work: Q4692941
cites work: The passing of a rational expression to a nondeterministic finite automaton
full work available at URL: s0304-3975(99)00019-5
OpenAlex ID: W2081718329
description: scientific article; zbMATH DE number 1495181