8 citations · 63 across the 21 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.AI2017★ 2 cited
New Techniques for Inferring L-Systems Using Genetic Algorithm
Jason Bernard, Ian McQuillan
Lindenmayer systems (L-systems) are a formal grammar system that iteratively rewrites all symbols of a string, in parallel. When visualized with a graphical interpretation, the ima…
cs.FL2017
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties
Oscar H. Ibarra, Ian McQuillan
We introduce a model of one-way language acceptors (a variant of a checking stack automaton) and show the following decidability properties: (1) The deterministic version has a dec…
cs.FL2017
On Store Languages of Language Acceptors
Oscar H. Ibarra, Ian McQuillan
It is well known that the "store language" of every pushdown automaton -- the set of store configurations (state and stack contents) that can appear as an intermediate step in acce…