Stem alphabet$ (all stems)

62 papers:

DLT-2015-CzybaST #automaton #finite #infinity #modelling

Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (CC, CS, WT), pp. 203–214.

LATA-2015-MikulskiPR #commutative #word

Square-Free Words over Partially Commutative Alphabets (LM, MP, WR), pp. 424–435.

TACAS-2014-MalerM #learning #regular expression #scalability

Learning Regular Languages over Large Alphabets (OM, IEM), pp. 485–499.

ICSME-2014-SpasojevicLN #documentation

Overthrowing the Tyranny of Alphabetical Ordering in Documentation Systems (BS, ML, ON), pp. 511–515.

CIAA-2014-Pighizzini #automaton

Investigations on Automata and Languages over a Unary Alphabet (GP), pp. 42–57.

CIAA-2014-PittouR #automaton #infinity

Weighted Variable Automata over Infinite Alphabets (MP, GR), pp. 304–317.

ICDAR-2013-JainD13a #identification #using

Writer Identification Using an Alphabet of Contour Gradient Descriptors (RJ, DSD), pp. 550–554.

ICDAR-2013-NayefB

Constructing a Hierarchical Structure from Symbol Alphabets of Technical Line Drawings (NN, TMB), pp. 773–777.

DLT-2013-JezO #ambiguity #boolean grammar

Unambiguous Conjunctive Grammars over a One-Letter Alphabet (AJ, AO), pp. 277–288.

DLT-2013-MercasS

3-Abelian Cubes Are Avoidable on Binary Alphabets (RM, AS), pp. 374–383.

ICALP-v1-2013-KucherovN #constant #realtime

Full-Fledged Real-Time Indexing for Constant Size Alphabets (GK, YN), pp. 650–660.

HCI-AMTE-2013-BrejchaM #interactive #towards #user interface

Semiotics of Interaction: Towards a UI Alphabet (JB, AM), pp. 13–21.

DLT-2012-NevisiR #reduction

Morphic Primitivity and Alphabet Reductions (HN, DR), pp. 440–451.

DLT-2012-ReidenbachS #pattern matching

Regular and Context-Free Pattern Languages over Small Alphabets (DR, MLS), pp. 130–141.

DLT-J-2009-Jiraskova11

Magic Numbers and Ternary Alphabet (GJ), pp. 331–344.

AFL-2011-Choffrut #finite #infinity #on the #word

On relations of finite words over infinite alphabets (CC), pp. 25–27.

DLT-2011-CherubiniFP #word

Short 3-Collapsing Words over a 2-Letter Alphabet (AC, AF, BP), pp. 469–471.

VMCAI-2011-HowarSM #abstraction #automation #automaton #learning #refinement

Automata Learning with Automated Alphabet Abstraction Refinement (FH, BS, MM), pp. 263–277.

DLT-2010-LehtinenO #equation #on the

On Language Equations XXK = XXL and XM = N over a Unary Alphabet (TL, AO), pp. 291–302.

LATA-2010-GrumbergKS #automaton #infinity

Variable Automata over Infinite Alphabets (OG, OK, SS), pp. 561–572.

LATA-2010-KlunderR #commutative #problem

Post Correspondence Problem with Partially Commutative Alphabets (BK, WR), pp. 356–367.

DRR-2009-TanVK #clustering #identification #online #using

Online writer identification using alphabetic information clustering (GXT, CVG, ACK), pp. 1–10.

ICDAR-2009-Pletschacher #adaptation #self

A Self-Adaptive Method for Extraction of Document-Specific Alphabets (SP), pp. 656–660.

ICDAR-2009-TanVK #identification #online

Impact of Alphabet Knowledge on Online Writer Identification (GXT, CVG, ACK), pp. 56–60.

DLT-2009-Jiraskova

Magic Numbers and Ternary Alphabet (GJ), pp. 300–311.

LATA-2009-IIBT #array

Counting Parameterized Border Arrays for a Binary Alphabet (TI, SI, HB, MT), pp. 422–433.

SIGIR-2009-McNameeNM

Addressing morphological variation in alphabetic languages (PM, CKN, JM), pp. 75–82.

LICS-2009-Tan #automaton #graph #infinity #reachability

Graph Reachability and Pebble Automata over Infinite Alphabets (TT), pp. 157–166.

DLT-J-2007-JirasekJS08 #automaton #finite #nondeterminism

Deterministic blow-UPS of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 617–631.

AFL-2008-AfoninK #regular expression

Semigroups of regular languages over a one letter alphabet are rational (SA, EK), pp. 61–73.

AFL-2008-BreveglieriCNR #equation #problem #satisfiability

NP-completeness of the alphabetical satisfiability problem for trace equations (LB, AC, CDN, ER), pp. 111–121.

ICPR-2008-LillholmG #image #novel #recognition

Novel image feature alphabets for object recognition (ML, LDG), pp. 1–4.

SAC-2008-TeleckenML #specification #visual notation

Applying markup language resources in the specification of visual alphabets and visual sentences (TLT, EVM, JVdL), pp. 222–227.

ICDAR-2007-MenasriVCA #recognition

Shape-Based Alphabet for Off-line Arabic Handwriting Recognition (FM, NV, MC, EA), pp. 969–973.

TACAS-2007-GheorghiuGP #composition #interface #verification

Refining Interface Alphabets for Compositional Verification (MG, DG, CSP), pp. 292–307.

SAS-2007-GallJ #automaton #infinity #representation #verification

Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification (TLG, BJ), pp. 52–68.

CIAA-2007-SteinbyT #morphism

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms (MS, CIT), pp. 265–276.

DLT-2007-JirasekJS #automaton #finite #nondeterminism

Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 254–265.

LATA-2007-Martugin #automaton

A series of slowly synchronizable automata with a zero state over a small alphabet (PVM), pp. 391–402.

FoSSaCS-2006-ChenFN #finite #infinity #on the #simulation

On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation (TC, WF, SN), pp. 1–15.

CHI-2006-HamzahTIH #effectiveness

Effectiveness of annotating by hand for non-alphabetical languages (MDH, ST, MI, TH), pp. 841–850.

CSL-2006-Segoufin #automaton #infinity #logic #word

Automata and Logics for Words and Trees over an Infinite Alphabet (LS), pp. 41–57.

ICDAR-2005-RinglstetterSML #fault

The Same is Not The same — Post Correction of Alphabet Confusion Errors in Mixed-Alphabet OCR Recognation (CR, KUS, SM, KL), pp. 406–410.

CIAA-2005-AbdullaDKN #automaton #nondeterminism #scalability

Minimization of Non-deterministic Automata with Large Alphabets (PAA, JD, LK, MN), pp. 31–42.

CHI-2005-GongT #design #mobile

Alphabetically constrained keypad designs for text entry on mobile devices (JG, PT), pp. 211–220.

FoSSaCS-2004-FokkinkN #finite #infinity #on the

On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds (WF, SN), pp. 182–194.

CIAA-2004-CampeanuP #automaton #bound #nondeterminism

Tight Bounds for NFA to DFCA Transformations for Binary Alphabets (CC, AP), pp. 306–307.

DLT-2004-AnselmoGM #2d #regular expression

Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet (MA, DG, MM), pp. 63–75.

DLT-2004-Reidenbach #equivalence #on the #pattern matching #problem

On the Equivalence Problem for E-pattern Languages over Small Alphabets (DR), pp. 368–380.

ICPR-v2-2004-SeropianGV #difference

Differentiation of Alphabets in Handwritten Texts (AS, MG, NV), pp. 622–625.

DLT-2003-Rahonis #automaton #transducer

Alphabetic Pushdown Tree Transducers (GR), pp. 423–436.

STOC-2002-GuruswamiI #linear

Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets (VG, PI), pp. 812–821.

ICPR-v4-2002-LamXS #difference #using

Differentiation between Alphabetic and Numeric Data Using NN Ensembles (LL, QX, CYS), pp. 40–43.

DLT-2001-GlasserS

Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets (CG, HS), pp. 251–261.

SIGIR-1995-MittendorfSS #library #probability #scalability

Applying Probabilistic Term Weighting to OCR Text in the Case of a Large Alphabetic Library Catalogue (EM, PS, PS), pp. 328–335.

DAC-1994-VittalM #design #using

Minimal Delay Interconnect Design Using Alphabetic Trees (AV, MMS), pp. 392–396.

ICALP-1994-PrzytyckaL #problem #revisited

The Optimal Alphabetic Tree Problem Revisited (TMP, LLL), pp. 251–262.

CHI-1994-VenoliaN94a #named #performance #self

T-Cube: a fast, self-disclosing pen-based alphabet (DV, FN), pp. 265–270.

STOC-1992-AmirBF #2d #independence

Alphabet Independent Two Dimensional Matching (AA, GB, MF), pp. 59–68.

ESEC-1991-Finkelstein #requirements

A (Neat) Alphabet of Requirements Engineering Issues (AF), pp. 489–491.

ICALP-1985-Keranen #morphism #on the #word

On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet (VK), pp. 338–347.

ICALP-1976-Valiant #decidability #equivalence #problem

The Equivalence Problem for DOL Systems and its Decidability for Binary Alphabets (LGV), pp. 31–37.