BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
machin (10)
automata (9)
ture (8)
time (6)
two (6)

Stem tape$ (all stems)

36 papers:

DATEDATE-2015-RanjanRVPRR #configuration management #memory management #named #using
DyReCTape: a dynamically reconfigurable cache using domain wall memory tapes (AR, SGR, RV, VSP, KR, AR), pp. 181–186.
DLTDLT-J-2013-KucukSY14 #automaton #finite
Finite Automata with Advice Tapes (UK, ACCS, AY), pp. 987–1000.
CHICHI-2014-WangL #communication #gesture #similarity #using
Kinect-taped communication: using motion sensing to study gesture use and similarity in face-to-face and computer-mediated brainstorming (HCW, CTL), pp. 3205–3214.
DLTDLT-2013-KucukSY #automaton #finite
Finite Automata with Advice Tapes (UK, ACCS, AY), pp. 301–312.
DLTDLT-2012-Carton #transducer
Two-Way Transducers with a Two-Way Output Tape (OC), pp. 263–272.
LATALATA-2010-LetichevskySS #automaton #equivalence #finite #multi #problem #proving #using
The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape (AAL, ASS, SKS), pp. 392–402.
CIAACIAA-J-2006-NicartCCGK07 #automaton #multi
Labelling Multi-Tape Automata with Constrained Symbol Classes (FN, JMC, TC, TG, AK), pp. 847–858.
CIAACIAA-2006-NicartCCGK #automaton #multi
Multi-tape Automata with Symbol Classes (FN, JMC, TC, TG, AK), pp. 126–136.
CIAACIAA-2004-ZakharovZ #automaton #multi #on the #problem #source code
On the Equivalence-Checking Problem for a Model of Programs Related with Multi-tape Automata (VAZ, IZ), pp. 293–305.
ICEISICEIS-v3-2003-DuarteCCG
Producing DTB From Audio Tapes (CD, LC, TC, NG), pp. 582–585.
CHICHI-2002-GrossmanBKFKB #3d
Creating principal 3D curves with digital tape drawing (TG, RB, GK, GWF, AK, WB), pp. 121–128.
CHICHI-2000-LeeSRI #named
HandSCAPE: a vectorizing tape measure for on-site measuring applications (JL, VS, SR, HI), pp. 137–144.
PODSPODS-1999-MoreMS #performance
Efficient Sequencing Tape-Resident Jobs (SM, SM, EAMS), pp. 33–43.
CIAAWIA-1997-KirazE #automaton #implementation #multi #prolog #speech
Multi-tape Automata for Speech and Language Systems: A Prolog Implementation (GAK, EGE), pp. 87–103.
CIAAWIA-1997-Velinov #education
Teaching Theory of Computation with Tape Machines (YV), pp. 213–227.
ICALPICALP-1996-Wiedermann #nondeterminism
Speeding-up Single-Tape Nondeterministic Computations by Single Alternation, with Separation Results (JW), pp. 381–392.
STOCSTOC-1994-JiangSV
Two heads are better than two tapes (TJ, JIS, PMBV), pp. 668–675.
SIGMODSIGMOD-1993-CareyHL #challenge #tuple
Tapes Hold Data, Too: Challenges of Tuples on Tertiary Store (MJC, LMH, ML), pp. 413–417.
CHICHI-1992-DegenMS
Working with audio: integrating personal tape recorders and desktop computers (LD, RM, GS), pp. 413–418.
ICALPICALP-1988-DietzfelbingerM #complexity #matrix #turing machine
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape (MD, WM), pp. 188–200.
STOCSTOC-1987-MaassSS #turing machine
Two Tapes Are Better than One for Off-Line Turing Machines (WM, GS, ES), pp. 94–100.
STOCSTOC-1986-GalilKS #graph #nondeterminism #on the #simulation #turing machine
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines (ZG, RK, ES), pp. 39–49.
STOCSTOC-1984-Maass #bound #nondeterminism #polynomial #turing machine
Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines (Extended Abstract) (WM), pp. 401–408.
STOCSTOC-1984-SlotB #on the #performance
On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space (CFS, PvEB), pp. 391–400.
ICALPICALP-1984-Jung #complexity #matrix #on the #performance #probability #problem
On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract) (HJ), pp. 281–291.
STOCSTOC-1982-DurisG #nondeterminism
Two Tapes are Better than One for Nondeterministic Machines (PD, ZG), pp. 1–7.
STOCSTOC-1982-Vitanyi #multi #realtime #simulation #turing machine
Real-Time Simulation of Multicounters by Oblivious One-Tape Turing Machines (PMBV), pp. 27–36.
STOCSTOC-1977-LeongS #multi #realtime #simulation
New Real-Time Simulations of Multihead Tape Units (BLL, JIS), pp. 239–248.
STOCSTOC-1977-Sudborough #automaton #bound
Separating Tape Bounded Auxiliary Pushdown Automata Classes (IHS), pp. 208–217.
ICALPICALP-1977-Erni #complexity #on the
On the Time and Tape Complexity of Hyper(1)-AFL’s (WJE), pp. 230–243.
ICALPICALP-1977-Sudborough #complexity
The Time and Tape Complexity of Developmental Languages (IHS), pp. 509–523.
ICALPICALP-1976-GillS #metric #turing machine
Ink, Dirty-Tape Turing Machines, and Quasicomplexity Measures (JG, IS), pp. 285–306.
STOCSTOC-1973-Hunt #complexity #on the
On the Time and Tape Complexity of Languages I (HBHI), pp. 10–19.
DACDAC-1972-SinkeyG #design #generative #interactive
The Interactive Computer Graphics System for Machined Part Design and NC Tape Generation (LOS, JZG), pp. 305–316.
ICALPICALP-1972-Monien #automaton #bound #turing machine
Relationship between Pushdown Automata and Tape-Bounded Turing Machines (BM), pp. 575–583.
STOCSTOC-1970-BookGW #bound
Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract (RVB, SAG, BW), pp. 92–99.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.