The MERLin Environment Applied to ⋆-NFAs
| Autor: | Lynette van Zijl, John-Paul Harper, Frank Olivier |
|---|---|
| Rok vydání: | 2001 |
| Předmět: |
TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES
Theoretical computer science Nested word Computer science Timed automaton Büchi automaton Computer Science::Computational Complexity ω-automaton Nondeterministic finite automaton with ε-moves Regular language DFA minimization Deterministic automaton Continuous spatial automaton Quantum finite automata Two-way deterministic finite automaton Nondeterministic finite automaton Generalized nondeterministic finite automaton Finite-state machine Mobile automaton Automaton TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Deterministic finite automaton Probabilistic automaton Computer Science::Programming Languages Automata theory Computer Science::Formal Languages and Automata Theory |
| Zdroj: | Implementation and Application of Automata ISBN: 9783540424918 CIAA |
| DOI: | 10.1007/3-540-44674-5_28 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|