Tight Bounds for Cut-Operations on Deterministic Finite Automata

DOI10.1007/978-3-319-23111-2_4zbMath1415.68126OpenAlexW811645096MaRDI QIDQ2945878

Sebastian Jakobi, Brink van der Merwe, Markus Holzer, 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)

Related Items

The cut operation in subclasses of convex languages (extended abstract) ⋮ The cut operation in subclasses of convex languages

Cites Work

• Cuts in Regular Expressions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item