I want to do pdf -> math/latex, but py-pdf doesn't seem to be good, how can I do this?

[brando90]

example low quality output:

1.1 FINITE AUTOMATA35FORMAL DEFINITION OF A FINITE AUTOMATONIn the preceding section, we used state diagrams to introduce finite automata.Now we define finite automata formally. Although state diagrams are easier tograsp intuitively, we need the formal definition, too, for two specific reasons.First, a formal definition is precise. It resolves any uncertainties about whatis allowed in a finite automaton. If you were uncertain about whether finiteautomata were allowed to have0accept states or whether they must have ex-actly one transition exiting every state for each possible input symbol, you couldconsult the formal definition and verify that the answer is yes in both cases. Sec-ond, a formal definition provides notation. Good notation helps you think andexpress your thoughts clearly.The language of a formal definition is somewhat arcane, having some simi-larity to the language of a legal document. Both need to be precise, and everydetail must be spelled out.Afi n i t ea u t o m a t o nh a ss e v e r a lp a r t s .I th a sas e to fs t a t e sa n dr u l e sf o rg o i n gfrom one state to another, depending on the input symbol. It has an input al-phabet that indicates the allowed input symbols. It has a start state and a set ofaccept states. The formal definition says that a finite automaton is a list of thosefive objects: set of states, input alphabet, rules for moving, start state, and acceptstates. In mathematical language, a list of five elements is often called a 5-tuple.Hence we define a finite automaton to be a 5-tuple consisting of these five parts.We use something called atransition function,f r e q u e n t l yd e n o t e dδ,t od e -fine the rules for moving. If the finite automaton has an arrow from a statexto a stateylabeled with the input symbol1,t h a tm e a n st h a ti ft h ea u t o m a t o ni sin statexwhen it reads a1,i tt h e nm o v e st os t a t ey.W e c a n i n d i c a t e t h es a m ething with the transition function by saying thatδ(x,1)=y.T h i sn o t a t i o ni sakind of mathematical shorthand. Putting it all together, we arrive at the formaldefinition of finite automata.
DEFINITION1.5Afinite automatonis a 5-tuple(Q,Σ,δ,q0,F),w h e r e1.Qis a finite set called thestates,2.Σis a finite set called thealphabet,3.δ:Q×Σ−→Qis thetransition function,14.q0∈Qis thestart state,a n d5.F⊆Qis theset of accept states.2
1Refer back to page 7 if you are uncertain about the meaning ofδ:Q×Σ−→Q.2Accept states sometimes are calledfinal states.

code

    path2pdf: Path = Path('~/data/maf/textbooks/def1.5.pdf').expanduser()
    # path2pdf: Path = Path('~/data/maf/textbooks/thm_pfsk_pf_1.5.pdf').expanduser()
    reader = PdfReader(path2pdf)
    number_of_pages = len(reader.pages)
    page = reader.pages[0]
    text = page.extract_text()
    # print(f'{text=}')
    print(text)

[MartinThoma]

pypdf cannot extract LaTex from PDF. Neither can any other library I'm aware of. You would need to start a machine learning project by yourself. A non-trivial one as well.

[brando90]

I found this: https://mathpix.com/pricing might use that for now as you said that's hard.

[brando90]

pdf2latex

• https://mathpix.com/use-cases/llms

---

• https://www.vertopal.com/ it's ok
• https://onlineconvertfree.com/convert/pdf/ its ok