scientific article; zbMATH DE number 1948484

MaRDI QIDQ4412097zbMATH OpenFDO

Authors Sebastian Seibert

Publication date 13 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2450/24500028.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45)

Recommendations

• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
• Translating regular expressions into small -free nondeterministic finite automata
• Regular Expressions and NFAs Without ε-Transitions
• scientific article; zbMATH DE number 1222566
• Computingϵ-Free NFA from Regular Expressions inO(nlog²(n)) Time

Cited in

(27)

• A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression
• Regular expressions into finite automata
• Regular expression for a language without empty word
• From regular expressions to DFA's using compressed NFA's
• Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions
• A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
• Self-certifying railroad diagrams. Or: how to teach nondeterministic finite automata
• From finite automata to regular expressions and back -- a summary on descriptional complexity
• scientific article; zbMATH DE number 5903158 (Why is no real title available?)
• EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS
• An optimal construction of finite automata from regular expressions
• Conversion of regular expressions into realtime automata
• From Regular Weighted Expressions to Finite Automata
• Simplifying regular expressions. A quantitative perspective
• Translating regular expression matching into transducers
• scientific article; zbMATH DE number 1222566 (Why is no real title available?)
• scientific article; zbMATH DE number 1472276 (Why is no real title available?)
• Minimized Thompson NFA
• Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
• From regular expressions to finite automata^∗
• From finite automata to regular expressions and back -- a summary on descriptional complexity
• Translating regular expressions into small -free nondeterministic finite automata
• A constructing method of regular expression's smaller -NFA
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
• Compact representations of automata for regular expression matching
• Simplifying regular expressions further
• Obtaining shorter regular expressions from finite-state automata

This page was built for publication:

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