Postfix automata

DOI10.1016/J.TCS.2014.10.050zbMath1303.68079OpenAlexW2914757613MaRDI QIDQ476910

Changyong Yu, Ning Lu, Maohua Jing, Wenbo Shi, Yi-Xian Yang

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.050

zbMATH Keywords

finite automataregular expressionfollow automataThompson's automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• From regular expressions to smaller NFAs
• Regular expressions into finite automata
• Follow automata.
• Reducing NFAs by invariant equivalences.
• THE ABSTRACT THEORY OF AUTOMATA
• Computingϵ-Free NFA from Regular Expressions inO(nlog²(n)) Time
• Programming Techniques: Regular expression search algorithm
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata

This page was built for publication: Postfix automata