Postfix automata
From MaRDI portal
Publication:476910
DOI10.1016/J.TCS.2014.10.050zbMATH Open1303.68079OpenAlexW2914757613MaRDI QIDQ476910FDOQ476910
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
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
- THE ABSTRACT THEORY OF AUTOMATA
- Title not available (Why is that?)
- Partial derivatives of regular expressions and finite automaton constructions
- Title not available (Why is that?)
- Follow automata.
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
- Title not available (Why is that?)
- Programming Techniques: Regular expression search algorithm
- Reducing NFAs by invariant equivalences.
- Regular expressions into finite automata
- Title not available (Why is that?)
- Computingϵ-Free NFA from Regular Expressions inO(nlog2(n)) Time
- From regular expressions to smaller NFAs
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)
