「明瞭」関係
Bruggemann-Klein & Wood の似たようなものが２つ
- http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.6882
Deterministic Regular Languages (1992) （実際には1991） - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.3277
One-Unambiguous Regular Languages (1997)
1997を読めば十分だろう。
教科書っぽいやつ。これも Bruggemann-Klein
- http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.9232
Regular Expressions into Finite Automata (1996)
↓これは役立つ！ これを実装予定。
- http://www.ii.uib.no/~dagh/reinclusionBORA.pdf
The Inclusion Problem for Regular Expressions
Author: Dag Hovland
あとは色々。
- http://ww2.cs.mu.oz.au/~sulzmann/talks/aplas04-talk.pdf
An Implementation of Subtyping among Regular Expression Types - http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.107.1456&rep=rep1&type=pdf
XHaskell - Adding Regular Expression Types to Haskell - http://www.stringology.org/event/CIAA2007/pres/Mon2/Yu.pdf
DETERMINISTIC CATERPILLAR EXPRESSIONS - http://webdb2004.cs.columbia.edu/papers/6-1.pdf
DTDs versus XML Schema: A Practical Study - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.1178
Valuations and unambiguity of languages, with applications to fractal geometry (1994)
"BOLTZMANN SAMPLING OF UNLABELLED STRUCTURES"てのもあったけど、関係ないよね。
