From 51d40d0c7f5324a1627ef19b0425c2708a06f984 Mon Sep 17 00:00:00 2001
From: denshd <71206238+denshd@users.noreply.github.com>
Date: Mon, 2 Dec 2024 21:46:55 +0300
Subject: [PATCH] little typo fix

convering |-> converting
---
 docs/src/theory.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/src/theory.md b/docs/src/theory.md
index dc62f84..5ff298d 100644
--- a/docs/src/theory.md
+++ b/docs/src/theory.md
@@ -111,7 +111,7 @@ The optimised DFA equivalent to the one above is simply:
 
 ![State diagram of the simpler DFA for `re"(\+|-)?(0|1)*"`](figure/large_machine.png)
 
-Unfortunately, as the name "powerset construction" hints, convering an NFA with N nodes may result in a DFA with up to 2^N nodes.
+Unfortunately, as the name "powerset construction" hints, converting an NFA with N nodes may result in a DFA with up to 2^N nodes.
 This inconvenient fact drives important design decisions in regex implementations.
 There are basically two approaches: