Learning Recursive Automata from Positive Examples

Abstract

ABSTRACT. In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer

Syntax and Semantics for Cinnamon Programming

“…It is worth mentioning that the concept of a cinnamon is an elaborated, filled with flesh version of an introduced much earlier but not so widely used skeletal notion -the notion of a recursive automaton / recursive finite-state automaton / recursive transition network / recursive control graph [3,[19][20][21][22][23][24][25][26][27]. It is a computation model equivalent in computational power to nondeterministic push-down automata.…”

“…• User has very powerful control tools -control states and system options -in order to direct and control the CN traversal [24,25]. In particular, that allows simple 'visual' implementation of o heuristic algorithms [4,5,28] o nondeterministic algorithms [29] o randomized algorithms [30] • The programmer can define the solution scope, that is, how many solutions will be found (if they exist) -a single solution, a fixed in advance number of solutions, all solutions, prompting after each solution if another solution should be sought.…”

CINNAMONS : A Computation Model Underlying Control Network Programming

“…It is worth mentioning that the concept of a cinnamon is an elaborated, filled with flesh version of an introduced much earlier but not so widely used skeletal notionthe notion of a recursive automaton / recursive finite-state automaton / recursive transition network / recursive control graph [14][15][16][17][18][19][20][21][22][23]. It is a computation model equivalent in computational power to nondeterministic push-down automata.…”

Syntax and Semantics for Cinnamon Programming

“…• User has very powerful control tools -control states and system options -in order to direct and control the CN traversal [24,25]. In particular, that allows simple 'visual' implementation of o heuristic algorithms [4,5,28] o nondeterministic algorithms [29] o randomized algorithms [30] • The programmer can define the solution scope, that is, how many solutions will be found (if they exist) -a single solution, a fixed in advance number of solutions, all solutions, prompting after each solution if another solution should be sought.…”

“…It is worth mentioning that the concept of a cinnamon is an elaborated, filled with flesh version of an introduced much earlier but not so widely used skeletal notion -the notion of a recursive automaton / recursive finite-state automaton / recursive transition network / recursive control graph [3,[19][20][21][22][23][24][25][26][27]. It is a computation model equivalent in computational power to nondeterministic push-down automata.…”