%I
%S 0,2,5,9,15,24,38,59,90,137,207,312,470,707,1062,1595,2394,3593,5391,
%T 8088
%N Accepted inputs by a certain adaptive automaton (number 4258072) with two adaptive functions and unary numbers as input.
%C This sequence comes from an adaptive finite automaton. These are the numbers (entered in unary base) accepted by the machine. This automaton grows as a ring, with transitions that collect the input symbols and there are two adaptive functions: F and G. F creates a new state between the next state and the state after it, with the G function being called in the transition after the new one. The G function makes the transition a clean one and makes the following transition call the F function. These functions are activated before the transition take place (they are "pre" functions). The initial machine has a single state, which is the final state and a transition to itself with the F function. The automaton grows as a ring and the function calls to F and G move around the machine, making the ring grown in an (apparently) erratic and chaotic fashion.
%D J. J. Neto, Adaptive RuleDriven Devices  General Formulation and Case Study, CIAA(2001)
%D J. J. Neto, Adaptive automata for contextdependent languages, SIGPLAN Notices, 29(9) (1994) pp. 115124
%D Future article about research on adaptive finite automata with simple rules and complex behavior.
%H Nicolau Werneck, <a href="http://www.lti.pcs.usp.br/~nwerneck/adaptoide/">Adaptoide</a>, a library for adaptive finite automata. Source code in C++ available.
%H J. J. Neto, <a href="http://link.springer.de/link/service/series/0558/bibs/2494/24940234.htm">Adaptive RuleDriven Devices  General Formulation and Case Study</a>, CIAA (2001)
%H J. J. Neto, <a href="http://doi.acm.org/10.1145/185009.185033">Adaptive automata for contextdependent languages</a>, SIGPLAN Notices, 29(9) (1994) pp. 115124,
%F FUN PRE F: GEN; * 1 T11 G; T1 1 *; END; FUN PRE G: GEN; T1 1 T11 F; T 1 T1; END; q1 1 q1 F; INIT q1; FINAL q1;
%o It is needed a program to simulate adaptive finite automata. The machine can be described by the following program in the SDMBA language: FUN PRE F: GEN; * 1 T11 G; T1 1 *; END; FUN PRE G: T1 1 T11 F; END; q1 1 q1 F; INIT q1; FINAL q1; (T, T1 and T11 mean the current state ("this"), the next state and the one after it. * means the newly created state. The body of the functions describe the adaptive actions, which are transition specifications. The "1" means the consumed symbol and the "F" or "G" at the end are the functions to be called (which can be none). )
%K hard,nonn,uned
%O 0,2
%A Nicolau Leal Werneck (nwerneck(AT)gmail.com), Jan 16 2008
