scientific article; zbMATH DE number 1948484

zbMATH Open1015.68102MaRDI QIDQ4412097FDOQ4412097

Sebastian Seibert

Publication date: 13 July 2003

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

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• Translating regular expression matching into transducers
• Title not available (Why is that?)
• Obtaining shorter regular expressions from finite-state automata
• From Regular Weighted Expressions to Finite Automata
• Extended to multi-tilde-bar regular expressions and efficient finite automata constructions

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)