I used simple rules to make DFAs that kinda match accepted physics models

Summary

I USED SIMPLE RULES TO MAKE DETERMINISTIC FINITE AUTOMATAS THAT RESONATE WITH OUR (AS OF 2025) MOST ACCEPTED MODELS OF PHYSICS There are 5 major steps in making the DFAs. (& while we can't say for sure what the minimally interesting ways to do this are, we can say that they're probably the basic datas & operations found in computer science, such as trees & edges & binary strings & substrings & concatenations.) (1) Take the minimally interesting set of characters. Take the set X of all binary strings (so just 0s & 1s) of length 6 (why? to be explained later). (2) Use the minimally interesting way to make edges. To generate a hierarchical tree, for each string y in X, draw an edge between y & the string z in X which is equal to the concatenation of the indices 234 + 345 of y. & to generate nontree edges of type A, do the same but for the indices 456 + 123. Why do things this way? Because, retroactively, it's all about pairs & binaries & balances & symmetries, so you take halves/trigrams & combine them in the different ways that thematically follow. You have 123 + 456, 456 + 123, 234 + 345, & 345 + 234. The 1st is an identity operation. The 2nd creates type A nontree edges. The 3rd creates a hierarchical tree, (& which is like the identity operation, & which suggests partial identity). The 4th creates type B nontree edges. The 1st is unused, & the 4th is redundant because you can just do the 2nd (& which compresses the 4th in the 8 digits DFA). So only the 2nd & the 3rd are really used. (3) Pair strings (by symmetry or by complementarity where there's no symmetry) to minimize repetition in parsing, & to maximize dynamism. (4) Order by 000000 111111 010101 101010 (because there's nothing & which is like 0, then 0 & 1, then 00 & 11 & 01 & 10, & the rest follows). & then, where possible, order pairs by decreasing energy & or linecount, (excepting "c1234" & "e1234", because "a" & "d", & "c" & "e" increase). (5) Parse by pairs or singletons, then by depth, then by breadth, ...