A finite state machine is provided. The finite state machine causes a function to be carried out in dependence on at least an event input to the finite state machine and the current state of the finite state machine. Associations between the functions that are to be carried out and combinations of the states and the events are identified using an associative array. The associations identified using the associative array are amended while the finite state machine is operating to dynamically reconfigure the operation of the finite state machine.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A computer-implemented method, comprising: operating a finite state machine which causes a function to be carried out in dependence on at least an event input to the finite state machine and the current state of the finite state machine; identifying associations between the functions that are to be carried out and combinations of the states and the events using an associative array; and amending the associations identified using the associative array while the finite state machine is operating to dynamically reconfigure the operation of the finite state machine. 2. The method according to claim 1, wherein the finite state machine is constructed using State Chart eXtensible Markup Language, the associations identified using the associative array being amended by receiving input of an eXtensible Markup Language file and parsing the XML file. 3. The method according to claim 1, wherein at least some of the associations identified using the associative array are indexed in the associative array by use of keys, the keys being non-sequential. 4. The method according to claim 3, wherein the keys are randomly or pseudorandomly generated. 5. The method according to claim 1, wherein at least some of the associations identified using the associative array are accessed using nested hash tables in which at least a first hash table has a second hash table nested therein, one of said hash tables storing identifiers of states of the finite state machine and the other of said hash tables storing identifiers of events. 6. The method according to claim 1, wherein the finite state machine is implemented on telecommunications apparatus. 7. A computing apparatus, comprising: at least one processor; and at least one memory, wherein the processor and the memory are configured to cause the apparatus to operate a finite state machine which causes a function to be carried out in dependence on at least an event input to the finite state machine and the current state of the finite state machine, and wherein associations between the functions that are to be carried out and combinations of the states and the events are identified using an associative array, the associations identified using the associative array being amendable while the finite state machine is operating to allow the operation of the finite state machine to be dynamically reconfigured. 8. The apparatus according to claim 7, configured such that the finite state machine is constructed using State Chart eXtensible Markup Language, the associations identified using the associative array being amended by the apparatus receiving input of an eXtensible Markup Language file and parsing the XML file. 9. The apparatus according to claim 7, configured such that at least some of associations identified using the associative array are indexed in the associative array by use of keys, the keys being non-sequential. 10. The apparatus according to claim 9, configured such that the keys are randomly or pseudorandomly generated. 11. The apparatus according to claim 7, configured such that at least some of the associations identified using the associative array are accessed using nested hash tables in which at least a first hash table has a second hash table nested therein, one of said hash tables storing identifiers of states of the finite state machine and the other of said hash tables storing identifiers of events. 12. The apparatus according to claim 7, wherein the computing apparatus is a telecommunications apparatus. 13. A non-transitory computer-readable storage medium comprising a set of computer-readable instructions stored thereon, which, when executed by a processing system, cause the processing system to carry out a method, the method comprising: operating a finite state machine which causes a function to be carried out in dependence on at least an event input to the finite state machine and the current state of the finite state machine; identifying associations between the functions that are to be carried out and combinations of the states and the events using an associative array; and amending the associations identified using the associative array while the finite state machine is operating to dynamically reconfigure the operation of the finite state machine. 14. The non-transitory computer-readable storage medium according to claim 13, wherein at least some of the associations identified using the associative array are stored in a hash table, the index of the location of the data of each of said functions in the hash table being obtained as a hash of identifiers of the corresponding current state and event for said function. 15. The non-transitory computer-readable storage medium according to claim 13, wherein the finite state machine is constructed using State Chart eXtensible Markup Language, the associations identified using the associative array being amended by receiving input of an eXtensible Markup Language file and parsing the XML file. 16. The non-transitory computer-readable storage medium according to claim 13, wherein at least some of the associations identified using the associative array are indexed in the associative array by use of keys, the keys being non-sequential. 17. The non-transitory computer-readable storage medium according to claim 16, wherein the keys are randomly or pseudorandomly generated. 18. The non-transitory computer-readable storage medium according to claim 13, wherein at least some of the associations identified using the associative array are accessed using nested hash tables in which at least a first hash table has a second hash table nested therein, one of said hash tables storing identifiers of states of the finite state machine and the other of said hash tables storing identifiers of events.