Conferences in DBLP

(lata)
2010 (conf/lata/2010)

1. 
   Complexity in Convex Languages. [Citation Graph (, )][DBLP]
   
   
2. 
   Three Learnable Models for the Description of Language. [Citation Graph (, )][DBLP]
   
   
3. 
   Arbology: Trees and Pushdown Automata. [Citation Graph (, )][DBLP]
   
   
4. 
   Analysis of Communicating Automata. [Citation Graph (, )][DBLP]
   
   
5. 
   Complexity of the Satisfiability Problem for a Class of Propositional Schemata. [Citation Graph (, )][DBLP]
   
   
6. 
   A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton. [Citation Graph (, )][DBLP]
   
   
7. 
   A Fast Longest Common Subsequence Algorithm for Similar Strings. [Citation Graph (, )][DBLP]
   
   
8. 
   Abelian Square-Free Partial Words. [Citation Graph (, )][DBLP]
   
   
9. 
   Avoidable Binary Patterns in Partial Words. [Citation Graph (, )][DBLP]
   
   
10. 
    Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. [Citation Graph (, )][DBLP]
    
    
11. 
    Pregroup Grammars with Letter Promotions. [Citation Graph (, )][DBLP]
    
    
12. 
    A Hierarchical Classification of First-Order Recurrent Neural Networks. [Citation Graph (, )][DBLP]
    
    
13. 
    Choosing Word Occurrences for the Smallest Grammar Problem. [Citation Graph (, )][DBLP]
    
    
14. 
    Agreement and Cliticization in Italian: A Pregroup Analysis. [Citation Graph (, )][DBLP]
    
    
15. 
    Geometricity of Binary Regular Languages. [Citation Graph (, )][DBLP]
    
    
16. 
    On the Expressive Power of FO[ + ]. [Citation Graph (, )][DBLP]
    
    
17. 
    Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach. [Citation Graph (, )][DBLP]
    
    
18. 
    Operator Precedence and the Visibly Pushdown Property. [Citation Graph (, )][DBLP]
    
    
19. 
    On the Maximal Number of Cubic Runs in a String. [Citation Graph (, )][DBLP]
    
    
20. 
    On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT. [Citation Graph (, )][DBLP]
    
    
21. 
    Parametric Metric Interval Temporal Logic. [Citation Graph (, )][DBLP]
    
    
22. 
    Short Witnesses and Accepting Lassos in omega-Automata. [Citation Graph (, )][DBLP]
    
    
23. 
    Grammar-Based Compression in a Streaming Model. [Citation Graph (, )][DBLP]
    
    
24. 
    Simplifying Regular Expressions. [Citation Graph (, )][DBLP]
    
    
25. 
    A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks. [Citation Graph (, )][DBLP]
    
    
26. 
    The Inclusion Problem for Regular Expressions. [Citation Graph (, )][DBLP]
    
    
27. 
    Learnability of Automatic Classes. [Citation Graph (, )][DBLP]
    
    
28. 
    Untestable Properties Expressible with Four First-Order Quantifiers. [Citation Graph (, )][DBLP]
    
    
29. 
    The Copying Power of Well-Nested Multiple Context-Free Grammars. [Citation Graph (, )][DBLP]
    
    
30. 
    Post Correspondence Problem with Partially Commutative Alphabets. [Citation Graph (, )][DBLP]
    
    
31. 
    Reversible Pushdown Automata. [Citation Graph (, )][DBLP]
    
    
32. 
    String Extension Learning Using Lattices. [Citation Graph (, )][DBLP]
    
    
33. 
    The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape. [Citation Graph (, )][DBLP]
    
    
34. 
    Primitive Words Are Unavoidable for Context-Free Languages. [Citation Graph (, )][DBLP]
    
    
35. 
    Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness. [Citation Graph (, )][DBLP]
    
    
36. 
    Hard Counting Problems for Partial Words. [Citation Graph (, )][DBLP]
    
    
37. 
    Exact Analysis of Horspool's and Sunday's Pattern Matching Algorithms with Probabilistic Arithmetic Automata. [Citation Graph (, )][DBLP]
    
    
38. 
    SA-REPC - Sequence Alignment with Regular Expression Path Constraint. [Citation Graph (, )][DBLP]
    
    
39. 
    CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages. [Citation Graph (, )][DBLP]
    
    
40. 
    A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems. [Citation Graph (, )][DBLP]
    
    
41. 
    Using Sums-of-Products for Non-standard Reasoning. [Citation Graph (, )][DBLP]
    
    
42. 
    Restarting Automata with Structured Output and Functional Generative Description. [Citation Graph (, )][DBLP]
    
    
43. 
    A Randomized Numerical Aligner (rNA). [Citation Graph (, )][DBLP]
    
    
44. 
    Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data. [Citation Graph (, )][DBLP]
    
    
45. 
    Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R). [Citation Graph (, )][DBLP]
    
    
46. 
    Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem. [Citation Graph (, )][DBLP]
    
    
47. 
    Variable Automata over Infinite Alphabets. [Citation Graph (, )][DBLP]
    
    
48. 
    Some Minimality Results on Biresidual and Biseparable Automata. [Citation Graph (, )][DBLP]
    
    
49. 
    Extending Stochastic Context-Free Grammars for an Application in Bioinformatics. [Citation Graph (, )][DBLP]
    
    
50. 
    Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages. [Citation Graph (, )][DBLP]
    
    
51. 
    Complexity of Guided Insertion-Deletion in RNA-Editing. [Citation Graph (, )][DBLP]