A New Family of Regular Operators Fitting with the Position Automaton Computation
From MaRDI portal
Recommendations
Cites work
- Characterization of Glushkov automata
- Computingϵ-Free NFA from Regular Expressions inO(nlog2(n)) Time
- Follow automata.
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- scientific article; zbMATH DE number 3165536 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3251424 (Why is no real title available?)
- Implementation and Application of Automata
- Implementation and Application of Automata
- Mathematical Foundations of Computer Science 2004
- Regular expression for a language without empty word
- Regular expressions: new results and open problems
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
Cited in
(6)
This page was built for publication: A New Family of Regular Operators Fitting with the Position Automaton Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599111)