Oscar H. Ibarra

Publication Activity (10 Years)

Years Active: 1967-2024
Publications (10 Years): 67

Top Venues

CoRR

Inf. Comput.

Theor. Comput. Sci.

Int. J. Found. Comput. Sci.

Publications

Oscar H. Ibarra, Ian McQuillan
Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors. CoRR (2024)
Oscar H. Ibarra, Ian McQuillan
Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors. DLT (2024)
Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche
Unboundedness problems for machines with reversal-bounded counters. CoRR (2023)
Oscar H. Ibarra, Ian McQuillan
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines. Inf. Comput. 292 (2023)
Oscar H. Ibarra, Ian McQuillan
On the Containment Problem for Deterministic Multicounter Machine Models. ATVA (1) (2023)
Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche
Unboundedness Problems for Machines with Reversal-Bounded Counters. FoSSaCS (2023)
Oscar H. Ibarra, Ian McQuillan
On the complexity of decision problems for some classes of machines and applications. Inf. Comput. 294 (2023)
Oscar H. Ibarra, Ian McQuillan
State Grammars with Stores. CoRR (2022)
Arturo Carpi, Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
Relationships Between Bounded Languages, Counter Machines, Finite-Index Grammars, Ambiguity, and Commutative Regularity. CoRR (2022)
Oscar H. Ibarra, Ian McQuillan
On the Complexity of Decision Problems for Counter Machines with Applications to Coding Theory. DLT (2022)
Oscar H. Ibarra, Ian McQuillan
Semilinearity of Families of Languages. CoRR (2022)
Oscar H. Ibarra, Ian McQuillan
On Families of Full Trios Containing Counter Machine Languages. CoRR (2022)
Oscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero
Space Complexity of Stack Automata Models. CoRR (2022)
Oscar H. Ibarra, Ian McQuillan
Generalizations of Checking Stack Automata: Characterizations and Hierarchies. CoRR (2022)
Oscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero
Space Complexity of Stack Automata Models. Int. J. Found. Comput. Sci. 32 (6) (2021)
Arturo Carpi, Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity. Theor. Comput. Sci. 862 (2021)
Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
On finite-index indexed grammars and their restrictions. Inf. Comput. 279 (2021)
Oscar H. Ibarra, Ian McQuillan
Generalizations of Checking Stack Automata: Characterizations and Hierarchies. Int. J. Found. Comput. Sci. 32 (5) (2021)
Oscar H. Ibarra, Sartaj K. Sahni
Announcement. Int. J. Found. Comput. Sci. 32 (7) (2021)
Oscar H. Ibarra, Jozef Jirásek Jr., Ian McQuillan, Luca Prigioniero
Space Complexity of Stack Automata Models. DLT (2020)
Oscar H. Ibarra, Ian McQuillan
On Store Languages and Applications. CoRR (2020)
Oscar H. Ibarra, Ian McQuillan
Semilinearity of Families of Languages. Int. J. Found. Comput. Sci. 31 (8) (2020)
Oscar H. Ibarra, Ian McQuillan
On store languages and applications. Inf. Comput. 267 (2019)
Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar
On counting functions and slenderness of languages. CoRR (2019)
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
On the Density of Context-Free and Counter Languages. CoRR (2019)
Oscar H. Ibarra, Ian McQuillan
State grammars with stores. Theor. Comput. Sci. 798 (2019)
Oscar H. Ibarra, Ian McQuillan
On the Density of Languages Accepted by Turing Machines and Other Machine Models. CoRR (2019)
Oscar H. Ibarra, Ian McQuillan
On families of full trios containing counter machine languages. Theor. Comput. Sci. 799 (2019)
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
Insertion Operations on Deterministic Reversal-Bounded Counter Machines. CoRR (2019)
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
Insertion operations on deterministic reversal-bounded counter machines. J. Comput. Syst. Sci. 104 (2019)
Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar
On counting functions and slenderness of languages. Theor. Comput. Sci. 777 (2019)
Oscar H. Ibarra, Ian McQuillan
Generalizations of Checking Stack Automata: Characterizations and Hierarchies. DLT (2018)
Oscar H. Ibarra, Ian McQuillan
On store languages of language acceptors. Theor. Comput. Sci. 745 (2018)
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
On the complexity and decidability of some problems involving shuffle. Inf. Comput. 259 (2) (2018)
Oscar H. Ibarra, Ian McQuillan
On the Density of Languages Accepted by Turing Machines and Other Machine Models. J. Autom. Lang. Comb. 23 (1-3) (2018)
Oscar H. Ibarra, Koji Nakano, Akihiro Fujiwara, Susumu Matsumae
Introduction to APDCM 2018. IPDPS Workshops (2018)
Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar
On Counting Functions of Languages. DLT (2018)
Oscar H. Ibarra, Ian McQuillan
Variations of checking stack automata: Obtaining unexpected decidability properties. Theor. Comput. Sci. 738 (2018)
Oscar H. Ibarra, Ian McQuillan
State Grammars with Stores. DCFS (2018)
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
On the Density of Context-Free and Counter Languages. Int. J. Found. Comput. Sci. 29 (2) (2018)
Oscar H. Ibarra, Zhe Dang, Qin Li
Accepting runs in a two-way finite automaton. Inf. Comput. 260 (2018)
Oscar H. Ibarra
Grammatical characterizations of NPDAs and VPDAs with counters. Theor. Comput. Sci. 746 (2018)
Oscar H. Ibarra, Ian McQuillan
Semilinearity of Families of Languages. CIAA (2018)
Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra
Information rate of some classes of non-regular languages: An automata-theoretic approach. Inf. Comput. 256 (2017)
Oscar H. Ibarra, Cewei Cui, Zhe Dang, Thomas R. Fischer
Lossiness of communication channels modeled by transducers. Comput. 6 (2) (2017)
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
Deletion operations on deterministic families of automata. Inf. Comput. 256 (2017)
Oscar H. Ibarra, Ian McQuillan
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties. CoRR (2017)
Oscar H. Ibarra, Ian McQuillan
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties. DLT (2017)
Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
On Finite-Index Indexed Grammars and Their Restrictions. LATA (2017)
Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki
On the overlap assembly of strings and languages. Nat. Comput. 16 (1) (2017)
Oscar H. Ibarra, Koji Nakano
Introduction to APDCM Workshop. IPDPS Workshops (2017)
Srujan Kumar Enaganti, Oscar H. Ibarra, Lila Kari, Steffen Kopecki
Further remarks on DNA overlap assembly. Inf. Comput. 253 (2017)
Oscar H. Ibarra, Ian McQuillan
On Store Languages of Language Acceptors. CoRR (2017)
Oscar H. Ibarra, Ian McQuillan
On Families of Full Trios Containing Counter Machine Languages. DLT (2016)
Zhe Dang, Thomas R. Fischer, William J. Hutton III, Oscar H. Ibarra, Qin Li
Quantifying communication in synchronized languages. Theor. Comput. Sci. 654 (2016)
Oscar H. Ibarra
Visibly Pushdown Automata and Transducers with Counters. Fundam. Informaticae 148 (3-4) (2016)
Oscar H. Ibarra, Bala Ravikumar
On bounded languages and reversal-bounded automata. Inf. Comput. 246 (2016)
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
On the Complexity and Decidability of Some Problems Involving Shuffle. CoRR (2016)
Francis Y. L. Chin, Oscar H. Ibarra, Sartaj K. Sahni
Announcement. Int. J. Found. Comput. Sci. 27 (8) (2016)
Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra
Execution information rate for some classes of automata. Inf. Comput. 246 (2016)
Oscar H. Ibarra
On decidability and closure properties of language classes with respect to bio-operations. Nat. Comput. 15 (2) (2016)
Oscar H. Ibarra, Koji Nakano, Akihiro Fujiwara, Susumu Matsumae
APDCM Introduction and Committees. IPDPS Workshops (2016)
Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
On Finite-Index Indexed Grammars and Their Restrictions. CoRR (2016)
Oscar H. Ibarra, Ian McQuillan
On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L. CIAA (2016)
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
Deletion Operations on Deterministic Families of Automata. CoRR (2016)
Oscar H. Ibarra, Ian McQuillan
The effect of end-markers on counter machines and commutativity. Theor. Comput. Sci. 627 (2016)
Oscar H. Ibarra, Lila Kari, Steffen Kopecki
Preface. Nat. Comput. 15 (1) (2016)
Zhe Dang, Thomas R. Fischer, William J. Hutton III, Oscar H. Ibarra, Qin Li
Quantifying Communication in Synchronized Languages. COCOON (2015)
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
Insertion Operations on Deterministic Reversal-Bounded Counter Machines. LATA (2015)
Arto Salomaa, Francis Y. L. Chin, Oscar H. Ibarra, Sartaj Sahni
Alberto Apostolico. Int. J. Found. Comput. Sci. 26 (5) (2015)
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
Deletion Operations on Deterministic Families of Automata. TAMC (2015)
Oscar H. Ibarra
On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers. Int. J. Found. Comput. Sci. 26 (7) (2015)
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
On the Density of Context-Free and Counter Languages. DLT (2015)
Oscar H. Ibarra, Shinnosuke Seki
Semilinear Sets and Counter Machines: a Brief Survey. Fundam. Informaticae 138 (1-2) (2015)
Oscar H. Ibarra, Koji Nakano, Akihiro Fujiwara, Susumu Matsumae
APDCM Introduction and Committees. IPDPS Workshops (2015)
Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
On the Complexity and Decidability of Some Problems Involving Shuffle. DCFS (2015)
Oscar H. Ibarra, Cewei Cui, Zhe Dang, Thomas R. Fischer
Lossiness of Communication Channels Modeled by Transducers. CiE (2014)
Oscar H. Ibarra
On Decidability and Closure Properties of Language Classes with Respect to Bio-operations. DNA (2014)
Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra
Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach - (Extended Abstract). MFCS (1) (2014)
Oscar H. Ibarra
Automata with Reversal-Bounded Counters: A Survey. DCFS (2014)
Oscar H. Ibarra
APDCM Introduction and Committees. IPDPS Workshops (2014)
Oscar H. Ibarra, Nicholas Q. Trân
Weak Synchronization and Synchronizability of Multi-tape Pushdown Automata and Turing Machines. J. Autom. Lang. Comb. 19 (1-4) (2014)
Fang Yu, Muath Alkhalaf, Tevfik Bultan, Oscar H. Ibarra
Automata-based symbolic string analysis for vulnerability detection. Formal Methods Syst. Des. 44 (1) (2014)
Oscar H. Ibarra
On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers. CIAA (2014)
Oscar H. Ibarra, Bala Ravikumar
On the Parikh Membership Problem for FAs, PDAs, and CMs. LATA (2014)
Oscar H. Ibarra, Bala Ravikumar
Some Decision Questions Concerning the Time Complexity of Language Acceptors. Int. J. Found. Comput. Sci. 25 (8) (2014)
Oscar H. Ibarra
APDCM Introduction. IPDPS Workshops (2013)
Oscar H. Ibarra, Bala Ravikumar
Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages. CIAA (2013)
Oscar H. Ibarra, Shinnosuke Seki
On the open problem of Ginsburg concerning semilinear sets and related problems. Theor. Comput. Sci. 501 (2013)
Oscar H. Ibarra, Bala Ravikumar
Some Decision Questions Concerning the Time Complexity of Language Acceptors. Developments in Language Theory (2013)
Oscar H. Ibarra, Bala Ravikumar
On Bounded Languages and Reversal-Bounded Automata. LATA (2013)
Oscar H. Ibarra, Nicholas Q. Trân
How to synchronize the Heads of a Multitape Automaton. Int. J. Found. Comput. Sci. 24 (6) (2013)
Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra
Execution Information Rate for Some Classes of Automata. LATA (2013)
Hsu-Chun Yen, Oscar H. Ibarra
Preface. Int. J. Found. Comput. Sci. 24 (7) (2013)
Oscar H. Ibarra, Shinnosuke Seki
On the Boundedness Property of Semilinear Sets. TAMC (2013)
Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra
Similarity in languages and programs. Theor. Comput. Sci. 498 (2013)
Oscar H. Ibarra, Nicholas Q. Trân
Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines. LATA (2012)
Oscar H. Ibarra, Shinnosuke Seki
Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines. Int. J. Found. Comput. Sci. 23 (6) (2012)
Ehsan Chiniforooshan, Mark Daley, Oscar H. Ibarra, Lila Kari, Shinnosuke Seki
One-reversal counter machines and multihead automata: Revisited. Theor. Comput. Sci. 454 (2012)
Oscar H. Ibarra, Nicholas Q. Trân
On synchronized multi-tape and multi-head automata. Theor. Comput. Sci. 449 (2012)

Oscar H. Ibarra.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Oscar H. Ibarra