Showing papers on "Büchi automaton published in 1974"
TL;DR: A method using operators for determining regular expressions defining error-corrupted strings is developed and is employed in the construction of a finite automaton, the outputs of which are stochastically generated by Bayes' Rule to take into account the frequencies with which strings appear as inputs and the probabilities of errors.
Abstract: Random occurrences of three types of errors in the input to a finite automaton are considered: an α error is a deletion of one symbol from the input string; a β error is an insertion of one extra symbol; and a δ error is a change of one symbol into another symbol. A method using operators for determining regular expressions defining error-corrupted strings is developed and is employed in the construction of a finite automaton, the outputs of which are stochastically generated by Bayes' Rule (with certain approximations) to take into account the frequencies with which strings appear as inputs and the probabilities of errors.
16 citations
TL;DR: It is demonstrated that the channel capacities of the linear automaton and its subautomata can be readily determined by an analytical procedure rather than by applying an iterative algorithm as required for general finite-state automata.
Abstract: A finite-state deterministic linear automaton is viewed as a communication channel from a source to a receiver, accepting source symbols as inputs and generating outputs for a receiver. The automaton is assumed to be composed of two subautomata, one representing the next-state function and one the output function. With the use of Shannon's theorem for capacities of discrete channels, it is demonstrated that the channel capacities of the linear automaton and its subautomata can be readily determined by an analytical procedure rather than by applying an iterative algorithm as required for general finite-state automata.
29 Jul 1974
TL;DR: Properties of value languages and translatability results of monadic program schemes under three restricted classes of interpretations (threshold counter, multiple threshold counter, and finite automaton interpretations) are presented.
Abstract: Properties of value languages and translatability results of monadic program schemes under three restricted classes of interpretations (threshold counter, multiple threshold counter, and finite automaton interpretations) are presented.