Postfix automata

DOI10.1016/J.TCS.2014.10.050MaRDI QIDQ476910zbMATH OpenOpenAlexFDO

Authors Maohua Jing, Ning Lu, Wenbo Shi, Changyong Yu, 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)

Recommendations

• scientific article; zbMATH DE number 4047133
• Membrane Computing
• scientific article; zbMATH DE number 2150277
• Finite automata
• Finite automata
• scientific article; zbMATH DE number 6300094
• Finite automata
• scientific article; zbMATH DE number 2150274
• P automata revisited
• scientific article; zbMATH DE number 3846879

Cites work

• scientific article; zbMATH DE number 193480 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 2087060 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• Computingϵ-Free NFA from Regular Expressions inO(nlog²(n)) Time
• Follow automata.
• From regular expressions to smaller NFAs
• Partial derivatives of regular expressions and finite automaton constructions
• Programming Techniques: Regular expression search algorithm
• Reducing NFAs by invariant equivalences.
• Regular expressions into finite automata
• THE ABSTRACT THEORY OF AUTOMATA
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata

This page was built for publication: Postfix automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476910)