8 citations · 53 across the 12 of their papers we have counts for
4 papers · 1 filter
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…
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…