The following pages link to Oscar H. Ibarra (Q243823):
Displayed 50 items.
- On the zero-inequivalence problem for loop programs (Q1171383) (← links)
- On the finite-valuedness problem for sequential machines (Q1173410) (← links)
- Learning regular languages from counterexamples (Q1176104) (← links)
- Parallel parsing on a one-way linear array of finite-state machines (Q1183569) (← links)
- Iterative algorithms for the planar convex hull problem on mesh-connected arrays (Q1184542) (← links)
- A hierarchy result for 2-dimensional TM's operating in small space (Q1193691) (← links)
- On space-bounded synchronized alternating Turing machines (Q1193901) (← links)
- A characterization of exponential-time languages by alternating context- free grammars (Q1193905) (← links)
- A note on simple programs with two variables (Q1210303) (← links)
- On 3-head versus 2-head finite automata (Q1211473) (← links)
- A note on semilinear sets and bounded-reversal multihead pushdown automata (Q1212796) (← links)
- Hierarchies of Turing machines with restricted tape alphabet size (Q1218271) (← links)
- A useful device for showing the solvability of some decision problems (Q1230657) (← links)
- Finite automata with multiplication (Q1233317) (← links)
- On two-way sequential transductions of full semi-AFL's (Q1249942) (← links)
- On the space complexity of recursive algorithms (Q1253916) (← links)
- Some decision problems concerning sequential transducers and checking automata (Q1256855) (← links)
- Synchronized finite automata and 2DFA reductions (Q1261467) (← links)
- Quadtree building algorithms on an \(SIMD\) hypercube (Q1309237) (← links)
- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata (Q1318689) (← links)
- Fast parallel algorithms for solving triangular systems of linear equations on the hypercube (Q1325983) (← links)
- On communication-bounded synchronized alternating finite automata (Q1338889) (← links)
- On the parallel complexity of loops (Q1391751) (← links)
- Controlled pushdown automata (Q1394126) (← links)
- Verification in loosely synchronous queue-connected discrete timed automata. (Q1401187) (← links)
- Generalized discrete timed automata: Decidable approximations for safety verification. (Q1401259) (← links)
- Past pushdown timed automata and safety verification. (Q1426159) (← links)
- Closure and decidability properties of some language classes with respect to ciliate bio-operations. (Q1426436) (← links)
- Item:Q243823 (redirect page) (← links)
- Image compression for fast wavelet-based subregion retrieval (Q1575450) (← links)
- Semilinearity of families of languages (Q1616975) (← links)
- Generalizations of checking stack automata: characterizations and hierarchies (Q1622991) (← links)
- On counting functions of languages (Q1622992) (← links)
- On the complexity and decidability of some problems involving shuffle (Q1706154) (← links)
- Accepting runs in a two-way finite automaton (Q1753992) (← links)
- On two-way nondeterministic finite automata with one reversal-bounded counter (Q1763701) (← links)
- On membrane hierarchy in P systems (Q1779299) (← links)
- Grammatical characterizations of NPDAs and VPDAs with counters (Q1784750) (← links)
- On store languages of language acceptors (Q1786598) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- On the control power of integer division (Q1838280) (← links)
- Counter machines and verification problems. (Q1853523) (← links)
- Augmenting the discrete timed automaton with other data structures. (Q1853524) (← links)
- Some decision problems concerning semilinearity and commutation. (Q1872706) (← links)
- Eliminating the storage tape in reachability constructions. (Q1874416) (← links)
- On two-way FA with monotonic counters and quadratic Diophantine equations (Q1884954) (← links)
- Catalytic P systems, semilinear sets, and vector addition systems (Q1884955) (← links)
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (Q1998865) (← links)
- On finite-index indexed grammars and their restrictions (Q2042723) (← links)
- On the complexity of decision problems for counter machines with applications to coding theory (Q2163996) (← links)