Download MONA Version 1.2 - User Manual

60
REFERENCES
[31] Frank Morawietz and Tom Cornell. The logic-automaton connection in linguistics. Technical report, Universität Tübingen Seminar für Sprachwissenschaft, 1998.
http://www.sfs.nphil.uni-tuebingen.de/~frank/papers.html.
[32] Paritosh K. Pandya. Dcvalid 1.2. Technical report, Theoretical Computer Science
Group, Tata Institute of Fundamental Research, 1997. Manual and system available
from: http://www.tcs.tifr.res.in/~pandya/dcvalid.html.
[33] Thomas R. Shiple, James H. Kukula, and Rajeev K. Ranjan. A comparison of Presburger
engines for EFSM reachability. In Computer Aided Verification, CAV ’98, Proceedings,
LNCS. Springer Verlag, 1998.
[34] L. Stockmeyer. The complexity of decision problems in automata theory and logic. PhD
thesis, Dept. of Electrical Eng., M.I.T., Cambridge, MA, 1974. Report TR-133.
[35] J.W. Thatcher and J.B. Wright. Generalized finite automata with an application to a
decision problem of second-order logic. Math. Systems Theory, 2:57–82, 1968.
[36] W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of
Theoretical Computer Science, volume B, pages 133–191. MIT Press/Elsevier, 1990.
Several of the articles are available from http://www.brics.dk/mona/papers.html.