activity
20092026
most citedVariations of Checking Stack Automata: Obtaining Unexpected Decidability Properties

12 citations · 116 across the 27 of their papers we have counts for

collaborators
Showing 2026Show all

1 paper · 1 filter

cs.FL2026

Language Acceptors with a Pushdown: Characterizations and Complexity

Oscar H. Ibarra, Ian McQuillan

We study one-way nondeterministic pushdown automata (NPDA), optionally with reversal-bounded counters. Finite-turn pushdown automata are pushdown automata with a bound on the numbe…