26 papers:
CIAA-2015-KutribW #capacity- Expressive Capacity of Concatenation Freeness (MK, MW), pp. 199–210.
DLT-2015-AlmeidaBKK #decidability #on the- On Decidability of Intermediate Levels of Concatenation Hierarchies (JA, JB, OK, MK), pp. 58–70.
GT-VMT-2013-KupperKB #category theory- Concatenation and other Closure Properties of Recognizable Languages in Adhesive Categories (SK, BK, HJSB).
ITiCSE-2012-GinatA #composition #pseudo- Pseudo abstract composition: the case of language concatenation (DG, RA), pp. 28–33.
LATA-2012-Hovland #constraints #problem #regular expression- The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints (DH), pp. 313–324.
ICDAR-2009-AssabieB #recognition #word- HMM-Based Handwritten Amharic Word Recognition with Feature Concatenation (YA, JB), pp. 961–965.
GPCE-2009-KongCY #parsing- Abstract parsing for two-staged languages with concatenation (SK, WC, KY), pp. 109–116.
ICALP-C-2008-HochS #on the- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak (JJH, AS), pp. 616–630.
LATA-2008-KallmeyerP #component #multi #on the #tuple- On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG) (LK, YP), pp. 263–274.
CIAA-J-2004-JirasekJS05 #complexity- State complexity of concatenation and complementation (JJ, GJ, AS), pp. 511–529.
DAC-2004-YangKM #architecture #named #optimisation- Divide-and-concatenate: an architecture level optimization technique for universal hash functions (BY, RK, DAM), pp. 614–617.
CIAA-2004-DebskiF #state machine- Concatenation State Machines and Simple Functions (WD, WF), pp. 113–124.
CIAA-2004-JirasekJS #complexity #regular expression- State Complexity of Concatenation and Complementation of Regular Languages (JJ, GJ, AS), pp. 178–189.
SAC-2004-MotaiK #3d #feature model #locality #robust- Concatenate feature extraction for robust 3D elliptic object localization (YM, AK), pp. 21–28.
ICFP-2002-Voigtlander #for free- Concatenate, reverse and map vanish for free (JV), pp. 14–25.
LICS-2002-PalsbergZ #performance #type inference #type system- Efficient Type Inference for Record Concatenation and Subtyping (JP, TZ), pp. 125–136.
STOC-2000-GuruswamiS #algorithm- List decoding algorithms for certain concatenated codes (VG, MS), pp. 181–190.
CIAA-2000-Pighizzini #complexity- Unary Language Concatenation and Its State Complexity (GP), pp. 252–262.
ICALP-1998-BaldanCM #graph #process- Concatenable Graph Processes: Relating Processes and Derivation Traces (PB, AC, UM), pp. 283–295.
ICALP-1998-Pin- Bridges for Concatenation Hierarchies (JÉP), pp. 431–442.
TAGT-1994-EngelfrietV #graph- Concatenation of Graphs (JE, JJV), pp. 368–382.
POPL-1992-Remy #for free #type system- Typing Record Concatenation for Free (DR), pp. 166–176.
POPL-1991-HarperP #calculus #symmetry- A Record Calculus Based on Symmetric Concatenation (RH, BCP), pp. 131–142.
LICS-1989-Wand #inheritance #multi #type inference- Type Inference for Record Concatenation and Multiple Inheritance (MW), pp. 92–97.
ICALP-1982-DurisH #automaton #finite #multi- Multihead Finite State Automata and Concatenation (PD, JH), pp. 176–186.
STOC-1979-Kosaraju79aa #realtime #simulation- Real-Time Simulation of Concatenable Double-Ended Queues by Double-Ended Queues (Preliminary Version) (SRK), pp. 346–351.