Finite automata and unary languages
Theoretical Computer Science
Statecharts: A visual formalism for complex systems
Science of Computer Programming
Testing random number generators
WSC '92 Proceedings of the 24th conference on Winter simulation
Maximally equidistributed combined Tausworthe generators
Mathematics of Computation
How to build a Beowulf: a guide to the implementation and application of PC clusters
How to build a Beowulf: a guide to the implementation and application of PC clusters
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Shift Register Sequences
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Random Number Generation with +-NFAs
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
| Hi-index | 0.00 |
There are known mechanisms to succinctly describe regular languages, such as nondeterministic finite automata, boolean automata, and statecharts. The MERLin project is an investigation into and comparison of different description mechanisms for the regular languages. In particular, we are concerned with descriptions which, for a specific application domain, often achieve succinctness. To this end we implemented a Modelling Environment for Regular Languages (MERLin). This paper describes the application of the MERLin system to analyze the behaviour of selective nondeterministic finite automata.