Results for "Author: alex vinokur"

The C++-program simulates a Turing Machine with faults, failures and recovery. It is defined by input files : * metafile, * description file, * states file, * alphabet file, * transition file, * input word(s) file(s). 1) Each row of metafile contains data related to some Expanded Turing Machine : * name of description file, * number of master tapes, * name of states file, * name of alphabet file, * name of transition file, * name(s) of input word(s) file(s). 2) Description file contains verbal description of the machine [optional]. 3) States file contains list of initial, halting and internal user-defined program states. 4) Alphabet contains list of empty, input and internal symbols. 5) Each row of transition contains some transition rule - some rules may be marked as check-points; - illegal daemon-defined rules (fault rules) may be added. 6) Each row of input word(s) contains input word for some tape. Known bug. Sometimes programs doesn't work if there are more than one check-point.

The C++-program simulates a Turing Machine with faults, failures and recovery. It is defined by input files : * metafile, * description file, * states file, * alphabet file, * transition file, * input word(s) file(s). 1) Each row of metafile contains data related to some Expanded Turing Machine : * name of description file, * number of master tapes, * name of states file, * name of alphabet file, * name of transition file, * name(s) of input word(s) file(s). 2) Description file contains verbal description of the machine [optional]. 3) States file contains list of initial, halting and internal user-defined program states. 4) Alphabet contains list of empty, input and internal symbols. 5) Each row of transition contains some transition rule - some rules may be marked as check-points; - illegal daemon-defined rules (fault rules) may be added. 6) Each row of input word(s) contains input word for some tape. Known bug. Sometimes programs doesn't work if there are more than one check-point.

The C++-program simulates a Turing Machine with faults, failures and recovery. It is defined by input files : * metafile, * description file, * states file, * alphabet file, * transition file, * input word(s) file(s). 1) Each row of metafile contains data related to some Expanded Turing Machine : * name of description file, * number of master tapes, * name of states file, * name of alphabet file, * name of transition file, * name(s) of input word(s) file(s). 2) Description file contains verbal description of the machine [optional]. 3) States file contains list of initial, halting and internal user-defined program states. 4) Alphabet contains list of empty, input and internal symbols. 5) Each row of transition contains some transition rule - some rules may be marked as check-points; - illegal daemon-defined rules (fault rules) may be added. 6) Each row of input word(s) contains input word for some tape. Known bug. Sometimes programs doesn't work if there are more than one check-point.

The C++-program simulates a Turing Machine with faults, failures and recovery. It is defined by input files : * metafile, * description file, * states file, * alphabet file, * transition file, * input word(s) file(s). 1) Each row of metafile contains data related to some Expanded Turing Machine : * name of description file, * number of master tapes, * name of states file, * name of alphabet file, * name of transition file, * name(s) of input word(s) file(s). 2) Description file contains verbal description of the machine [optional]. 3) States file contains list of initial, halting and internal user-defined program states. 4) Alphabet contains list of empty, input and internal symbols. 5) Each row of transition contains some transition rule - some rules may be marked as check-points; - illegal daemon-defined rules (fault rules) may be added. 6) Each row of input word(s) contains input word for some tape. Known bug. Sometimes programs doesn't work if there are more than one check-point.

The C++-program simulates a Turing Machine with faults, failures and recovery. It is defined by input files : * metafile, * description file, * states file, * alphabet file, * transition file, * input word(s) file(s). 1) Each row of metafile contains data related to some Expanded Turing Machine : * name of description file, * number of master tapes, * name of states file, * name of alphabet file, * name of transition file, * name(s) of input word(s) file(s). 2) Description file contains verbal description of the machine [optional]. 3) States file contains list of initial, halting and internal user-defined program states. 4) Alphabet contains list of empty, input and internal symbols. 5) Each row of transition contains some transition rule - some rules may be marked as check-points; - illegal daemon-defined rules (fault rules) may be added. 6) Each row of input word(s) contains input word for some tape. Known bug. Sometimes programs doesn't work if there are more than one check-point.

The C++-program simulates a Turing Machine with faults, failures and recovery. It is defined by input files : * metafile, * description file, * states file, * alphabet file, * transition file, * input word(s) file(s). 1) Each row of metafile contains data related to some Expanded Turing Machine : * name of description file, * number of master tapes, * name of states file, * name of alphabet file, * name of transition file, * name(s) of input word(s) file(s). 2) Description file contains verbal description of the machine [optional]. 3) States file contains list of initial, halting and internal user-defined program states. 4) Alphabet contains list of empty, input and internal symbols. 5) Each row of transition contains some transition rule - some rules may be marked as check-points; - illegal daemon-defined rules (fault rules) may be added. 6) Each row of input word(s) contains input word for some tape. Known bug. Sometimes programs doesn't work if there are more than one check-point.

The C++-program simulates a Turing Machine with faults, failures and recovery. It is defined by input files : * metafile, * description file, * states file, * alphabet file, * transition file, * input word(s) file(s). 1) Each row of metafile contains data related to some Expanded Turing Machine : * name of description file, * number of master tapes, * name of states file, * name of alphabet file, * name of transition file, * name(s) of input word(s) file(s). 2) Description file contains verbal description of the machine [optional]. 3) States file contains list of initial, halting and internal user-defined program states. 4) Alphabet contains list of empty, input and internal symbols. 5) Each row of transition contains some transition rule - some rules may be marked as check-points; - illegal daemon-defined rules (fault rules) may be added. 6) Each row of input word(s) contains input word for some tape. Known bug. Sometimes programs doesn't work if there are more than one check-point.

The C++-program simulates a Turing Machine with faults, failures and recovery. It is defined by input files : * metafile, * description file, * states file, * alphabet file, * transition file, * input word(s) file(s). 1) Each row of metafile contains data related to some Expanded Turing Machine : * name of description file, * number of master tapes, * name of states file, * name of alphabet file, * name of transition file, * name(s) of input word(s) file(s). 2) Description file contains verbal description of the machine [optional]. 3) States file contains list of initial, halting and internal user-defined program states. 4) Alphabet contains list of empty, input and internal symbols. 5) Each row of transition contains some transition rule - some rules may be marked as check-points; - illegal daemon-defined rules (fault rules) may be added. 6) Each row of input word(s) contains input word for some tape. Known bug. Sometimes programs doesn't work if there are more than one check-point.

The C++-program simulates a Turing Machine with faults, failures and recovery. It is defined by input files : * metafile, * description file, * states file, * alphabet file, * transition file, * input word(s) file(s). 1) Each row of metafile contains data related to some Expanded Turing Machine : * name of description file, * number of master tapes, * name of states file, * name of alphabet file, * name of transition file, * name(s) of input word(s) file(s). 2) Description file contains verbal description of the machine [optional]. 3) States file contains list of initial, halting and internal user-defined program states. 4) Alphabet contains list of empty, input and internal symbols. 5) Each row of transition contains some transition rule - some rules may be marked as check-points; - illegal daemon-defined rules (fault rules) may be added. 6) Each row of input word(s) contains input word for some tape. Known bug. Sometimes programs doesn't work if there are more than one check-point.

The C++-program simulates a Turing Machine with faults, failures and recovery. It is defined by input files : * metafile, * description file, * states file, * alphabet file, * transition file, * input word(s) file(s). 1) Each row of metafile contains data related to some Expanded Turing Machine : * name of description file, * number of master tapes, * name of states file, * name of alphabet file, * name of transition file, * name(s) of input word(s) file(s). 2) Description file contains verbal description of the machine [optional]. 3) States file contains list of initial, halting and internal user-defined program states. 4) Alphabet contains list of empty, input and internal symbols. 5) Each row of transition contains some transition rule - some rules may be marked as check-points; - illegal daemon-defined rules (fault rules) may be added. 6) Each row of input word(s) contains input word for some tape. Known bug. Sometimes programs doesn't work if there are more than one check-point.