Stem unari$ (all stems)

36 papers:

DLT-2015-CurrieMN #permutation

Unary Patterns with Permutations (JDC, FM, DN), pp. 191–202.

DLT-2015-GainutdinovaY #automaton #probability #problem #quantum

Unary Probabilistic and Quantum Automata on Promise Problems (AG, AY), pp. 252–263.

CIAA-2014-BiasiY #automaton

Unary Languages Recognized by Two-Way One-Counter Automata (MDB, AY), pp. 148–161.

CIAA-2014-Pighizzini #automaton

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

ICALP-v2-2014-ChistikovM #automaton #source code

Unary Pushdown Automata and Straight-Line Programs (DVC, RM), pp. 146–157.

DLT-J-2012-GeffertP13

Unary Coded NP-Complete Languages in Aspace(log log n) (VG, DP), p. 1167–?.

DLT-2013-LuPC

Deciding Determinism of Unary Languages Is coNP-Complete (PL, FP, HC), pp. 350–361.

DLT-2012-GeffertP

Unary Coded NP-Complete Languages in ASPACE (log log n) (VG, DP), pp. 166–177.

DLT-2012-KutribMW #automaton #finite #multi

States and Heads Do Count for Unary Multi-head Finite Automata (MK, AM, MW), pp. 214–225.

LATA-2011-Blanchet-SadriBZ #word

Unary Pattern Avoidance in Partial Words Dense with Holes (FBS, KB, AZ), pp. 155–166.

SAC-2011-ZhengC #database #query

Determinacy and rewriting of conjunctive queries over unary database schemas (LZ, HC), pp. 1039–1044.

AFL-J-2008-AfoninK10 #on the #regular expression

On the Structure of Finitely Generated Semigroups of Unary Regular Languages (SA, EK), pp. 689–704.

DLT-2010-GeffertP #automaton

Two-Way Unary Automata versus Logarithmic Space (VG, GP), pp. 197–208.

DLT-2010-LehtinenO #equation #on the

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

CIAA-J-2008-Pighizzini09 #automaton

Deterministic Pushdown Automata and Unary Languages (GP), pp. 629–645.

LATA-2009-LiuM #automation #complexity

Analysing Complexity in Classes of Unary Automatic Structures (JL, MM), pp. 518–529.

DLT-J-2007-Jez08 #boolean grammar

Conjunctive Grammars Generate Non-Regular Unary Languages (AJ), pp. 597–615.

CIAA-2008-Pighizzini #automaton

Deterministic Pushdown Automata and Unary Languages (GP), pp. 232–241.

CIAA-J-2006-Glockler07 #automaton

Forgetting Automata and Unary Languages (JG), pp. 813–827.

DLT-2007-Jez #boolean grammar

Conjunctive Grammars Can Generate Non-regular Unary Languages (AJ), pp. 242–253.

LATA-2007-GruberH #automaton #complexity #finite #nondeterminism

Computational Complexity of NFA Minimization for Finite and Unary Languages (HG, MH), pp. 261–272.

LICS-2007-Bojanczyk #logic

Two-way unary temporal logic over trees (MB), pp. 121–130.

CIAA-2006-Glockler #automaton

Forgetting Automata and Unary Languages (JG), pp. 186–197.

CSL-2006-DurandO #first-order #query

First-Order Queries over One Unary Function (AD, FO), pp. 334–348.

CSL-2006-RabinovichT #decidability

Decidable Theories of the Ordering of Natural Numbers with Unary Predicates (AMR, WT), pp. 562–574.

LICS-2003-GurevichS #higher-order #monad

Spectra of Monadic Second-Order Formulas with One Unary Function (YG, SS), pp. 291–300.

TLCA-2003-BucciarelliLP #modelling

Relative Definability and Models of Unary PCF (AB, BL, VP), pp. 75–89.

TLCA-2003-Laird #domain model

A Fully Abstract Bidomain Model of Unary FPC (JL), pp. 211–225.

CIAA-J-2000-PighizziniS02 #complexity

Unary Language Operations, State Complexity and Jacobsthal’s Function (GP, JS), pp. 145–159.

DLT-2002-HolzerK #complexity #nondeterminism

Unary Language Operations and Their Nondeterministic State Complexity (MH, MK), pp. 162–172.

CIAA-2000-Pighizzini #complexity

Unary Language Concatenation and Its State Complexity (GP), pp. 252–262.

CL-2000-NarendranR #decidability #formal method

The Theory of Total Unary RPO Is Decidable (PN, MR), pp. 660–672.

CSL-1997-DurandFL

Spectra with Only Unary Function Symbols (AD, RF, BL), pp. 189–202.

LICS-1997-EtessamiVW #first-order #logic

First-Order Logic with Two Variables and Unary Temporal Logic (KE, MYV, TW), pp. 228–235.

LOPSTR-1992-GallagherW #logic programming #source code

Deletion of Redundant Unary Type Predicates from Logic Programs (JPG, DAdW), pp. 151–167.

STOC-1983-KanellakisCV #dependence #polynomial #problem

Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract) (PCK, SSC, MYV), pp. 264–277.