CMSimulator app helps you to better understand four of the most known counter machines - Finite State Automaton, Pushdown Automaton, Linear Bounded Automaton, Turing machine. You can create new or load existing solutions from files. The application also contains examples (for each type of machines).

Furthermore the application also helps you to better understand four types of formal grammars from the Chomsky hierarchy - Regular grammar, Context-free grammar, Context-sensitive grammar, Unrestricted grammar. You can create new or load existing solutions from files. The application also contains examples.

You can create a list of symbols, states, transition rules and also choose the initial and final states. Then you can fill the tape and simulate the solution step by step, or go directly to the end of simulation. You can also mark any tape element as breakpoint to pause the simulation when the machine reaches this breakpoint.
Nondeterministic machines and solutions are also supported.

You can define your own grammar, test words if they belong to the defined grammar and visualize the derivation process with 4 different kinds of visualizations - Derivation table, Derivation tree, Linear derivation, Fixed derivation. The application also contains an interactive feature where you can test multiple words at the same time.

The application is still in development. Please, let me know if you find any bugs.