Output from a Voynich generator I'm working on.

[Dunsel]

Is it a Markov-chain generator or equivalent?

No. It’s a constrained recursive generator, not a simple probability-chain text model.  Markov chains eventually fail and spew out garbage.  I've ran this for 10000 pages and while it's not pretty Voynich, it still looks kinda Voynich.  A markov chain would drift into repeated junk.  Obviously, I still have a lot of knobs to turn.

<f5000v>
<f5000v.P1.1;K>      tchey.daicthy.oyechdl.shodaro.o.chey
<f5000v.P1.2;K>      kchor.otairin.cphey.tdoeeychhh.ddeechhh.cthy.kdoeeychhh.otol.daicthy
<f5000v.P1.3;K>      loaychhg.odar.tdoeeachh.cphey.doeechhh
<f5000v.P1.4;K>      otol.shodaro.ofsho.tdoeeychh.cthol.chey
<f5000v.P1.5;K>      dain.ofsho.yos.ldoeeach.cphy.loeeychh.chodain.kchor
<f5000v.P1.6;K>      o.doleechch.tdoeeychhm.ckhey.koshey.chey
<f5000v.P1.7;K>      tchol.os.daickhy.oyeychhg.doeaychhh
<f5000v.P1.8;K>      cteols.chey.chy.cshol.daiin
<f5000v.P1.9;K>      chey.cphy.tdoeeechg.oeeychhg.cheey
<f5000v.P1.10;K>    ooechdl.deeaychhh.tdoeoachh.cphy.cchey.tdoeeychhm
<f5000v.P1.11;K>    doleechch.chy.daiin.o.tdoeeychhm
<f5000v.P2.12;K>    o.kshy.otol.cfhol.tdoeeochhh.chol.cheey.cchey.doayachhh
<f5000v.P2.13;K>    o