The following pages link to Oscar H. Ibarra (Q243823):
Displaying 50 items.
- The effect of end-markers on counter machines and commutativity (Q265080) (← links)
- Quantifying communication in synchronized languages (Q344766) (← links)
- Similarity in languages and programs (Q391201) (← links)
- On the open problem of Ginsburg concerning semilinear sets and related problems (Q391304) (← links)
- On sets of numbers accepted by P/T systems composed by join (Q410705) (← links)
- On the containment and equivalence problems for two-way transducers (Q418777) (← links)
- On synchronized multi-tape and multi-head automata (Q443740) (← links)
- Further remarks on DNA overlap assembly (Q515580) (← links)
- On some decision questions concerning pushdown machines (Q593781) (← links)
- On the computational complexity of membrane systems (Q596128) (← links)
- On the universe, disjointness, and containment problems for simple machines (Q710740) (← links)
- One-reversal counter machines and multihead automata: revisited (Q714812) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- An efficient all-parses systolic algorithm for general context-free parsing (Q757072) (← links)
- Characterizations and computational complexity of systolic trellis automata (Q792091) (← links)
- Simple programming languages and restricted classes of Turing machines (Q792760) (← links)
- On the solvability of a class of Diophantine equations and applications (Q818150) (← links)
- On stateless multihead automata: hierarchies and the emptiness problem (Q844888) (← links)
- Deterministic catalytic systems are not universal (Q860859) (← links)
- Normal forms for spiking neural P systems (Q872205) (← links)
- On the computational complexity of P automata (Q876857) (← links)
- Execution information rate for some classes of automata (Q899317) (← links)
- On bounded languages and reversal-bounded automata (Q899318) (← links)
- On spiking neural P systems and partially blind counter machines (Q926511) (← links)
- Simulating FAS-induced apoptosis by using P systems (Q952199) (← links)
- Asynchronous spiking neural P systems (Q1019715) (← links)
- Characterizations of some classes of spiking neural P systems (Q1035724) (← links)
- A characterization of systolic binary tree automata and applications (Q1055191) (← links)
- On efficient recognition of transductions and relations (Q1066679) (← links)
- Fast parallel language recognition by cellular automata (Q1075053) (← links)
- On pebble automata (Q1088408) (← links)
- Some observations concerning alternating Turing machines using small space (Q1097697) (← links)
- Erratum to: Some observations concerning alternating Turing machines using small space (Q1097698) (← links)
- Two-dimensional iterative arrays: Characterizations and applications (Q1102749) (← links)
- Relating the power of cellular arrays to their closure properties (Q1104098) (← links)
- Some subclasses of context-free languages in \(NC^ 1\) (Q1112610) (← links)
- Optimal simulation of tree arrays by linear arrays (Q1120283) (← links)
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs (Q1124332) (← links)
- On iterative and cellular tree arrays (Q1124336) (← links)
- Adaptive partitioning and scheduling for enhancing WWW application performance (Q1130319) (← links)
- Simple counter machines and number-theoretic problems (Q1136223) (← links)
- The complexity of the equivalence problem for two characterizations of Presburger sets (Q1149429) (← links)
- The complexity of decision problems for finite-turn multicounter machines (Q1151753) (← links)
- Probabilistic algorithms and straight-line programs for some rank decision problems (Q1155356) (← links)
- Some simplified undecidable and NP-hard problems for simple programs (Q1157168) (← links)
- Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication (Q1157169) (← links)
- On the decidability of equivalence for deterministic pushdown transducers (Q1158772) (← links)
- On some decision problems for RAM programs (Q1159463) (← links)
- On the complexity of simple arithmetic expressions (Q1162150) (← links)
- 2DST mappings of languages and related problems (Q1164438) (← links)
