Tight bounds for cut-operations on deterministic finite automata

DOI10.1007/978-3-319-23111-2_4MaRDI QIDQ2945878zbMATH OpenOpenAlexFDO

Authors Markus Holzer, Sebastian Jakobi, Brink van der Merwe, Frank Drewes

Publication date 15 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-23111-2_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Tight bounds for cut-operations on deterministic finite automata
• State complexity of some operations on binary regular languages
• The range of state complexities of languages resulting from the cut operation
• The state complexities of some basic operations on regular languages
• scientific article; zbMATH DE number 1948495

Cites work

• Analyzing catastrophic backtracking behavior in practical regular expression matching
• Cuts in regular expressions
• scientific article; zbMATH DE number 3731310 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 3099421 (Why is no real title available?)

Cited in

(3)

• The cut operation in subclasses of convex languages (extended abstract)
• Tight bounds for cut-operations on deterministic finite automata
• The cut operation in subclasses of convex languages

This page was built for publication: Tight bounds for cut-operations on deterministic finite automata

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