Automatic Programming of Finite State Linear Programs
Copyright policy )Automatic Programming of Finite State Linear Programs
Finite State Linear Programs (FSLP) are introduced to model simple data processing applications. Essentially these are finite automata with the added capability of performing linear operations on a set of registers and the input. Algorithmic constructions are given to test equivalence of FSLP programs, and to minimize the number of states and registers. Linear algebraic methods are used for the register minimization procedure (and its correctness proof).
Specification and verification (program logics, model checking, etc.), register optimization, Formal languages and automata, finite automata, Models of computation (Turing machines, etc.), data processing
Specification and verification (program logics, model checking, etc.), register optimization, Formal languages and automata, finite automata, Models of computation (Turing machines, etc.), data processing
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!