12 citations · 116 across the 27 of their papers we have counts for
6 papers · 1 filter
Techniques for Inferring Context-Free Lindenmayer Systems With Genetic Algorithm
Jason Bernard, Ian McQuillan
Lindenmayer systems (L-systems) are a formal grammar system, where the most notable feature is a set of rewriting rules that are used to replace every symbol in a string in paralle…
Insertion Operations on Deterministic Reversal-Bounded Counter Machines
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
Several insertion operations are studied applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines. These operations are defined by…
On counting functions and slenderness of languages
Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar
We study counting-regular languages -- these are languages for which there is a regular language such that the number of strings of length in and are the same…
From Helmut Jürgensen's Former Students: The Game of Informatics Research
Mark Daley, Mark Eramian, Christopher Power +1
Personal reflections are given on being students of Helmut Jürgensen. Then, we attempt to address his hypothesis that informatics follows trend-like behaviours through the use of a…
On the Density of Languages Accepted by Turing Machines and Other Machine Models
Oscar H. Ibarra, Ian McQuillan
A language is dense if the set of all infixes (or subwords) of the language is the set of all words. Here, it is shown that it is decidable whether the language accepted by a nonde…
On the Density of Context-Free and Counter Languages
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
A language is said to be dense if every word in the universe is an infix of some word in . This notion has been generalized from the infix operation to arbitrary word operat…