Postfix automata
type: Item
instance of: scholarly article
title: Postfix automata
zbMATH Open document ID: 1303.68079
author: Maohua Jing
author: Ning Lu
author: Wenbo Shi
author: Changyong Yu
author: Yi-Xian Yang
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6376004
zbMATH Keywords: regular expression
zbMATH Keywords: finite automata
zbMATH Keywords: follow automata
zbMATH Keywords: Thompson's automata
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.10.050
OpenAlex ID: W2914757613
cites work: Q4714446
cites work: Q5541339
cites work: Programming Techniques: Regular expression search algorithm
cites work: Q4737707
cites work: Reducing NFAs by invariant equivalences.
cites work: THE ABSTRACT THEORY OF AUTOMATA
cites work: Partial derivatives of regular expressions and finite automaton constructions
cites work: From regular expressions to smaller NFAs
cites work: Q4040284
cites work: Regular expressions into finite automata
cites work: Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
cites work: Computingϵ-Free NFA from Regular Expressions inO(nlog2(n)) Time
cites work: Follow automata.
DOI: 10.1016/J.TCS.2014.10.050
Recommended article: Q3783586
Recommended article: Membrane Computing
Recommended article: Q4662826
Recommended article: Q3623564
Recommended article: Finite Automata
Recommended article: Q5418245
Recommended article: Finite automata
Recommended article: Q4662823
Recommended article: P automata revisited
Recommended article: Q3316599
description: scientific article; zbMATH DE number 6376004