Language and Automata Theory and Applications 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings /
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | , , |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2010.
|
| Σειρά: | Lecture Notes in Computer Science,
6031 |
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Invited Talks
- Complexity in Convex Languages
- Three Learnable Models for the Description of Language
- Arbology: Trees and Pushdown Automata
- Analysis of Communicating Automata
- Regular Papers
- Complexity of the Satisfiability Problem for a Class of Propositional Schemata
- A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton
- A Fast Longest Common Subsequence Algorithm for Similar Strings
- Abelian Square-Free Partial Words
- Avoidable Binary Patterns in Partial Words
- Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
- Pregroup Grammars with Letter Promotions
- A Hierarchical Classification of First-Order Recurrent Neural Networks
- Choosing Word Occurrences for the Smallest Grammar Problem
- Agreement and Cliticization in Italian: A Pregroup Analysis
- Geometricity of Binary Regular Languages
- On the Expressive Power of FO[?+?]
- Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
- Operator Precedence and the Visibly Pushdown Property
- On the Maximal Number of Cubic Runs in a String
- On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT
- Parametric Metric Interval Temporal Logic
- Short Witnesses and Accepting Lassos in ?-Automata
- Grammar-Based Compression in a Streaming Model
- Simplifying Regular Expressions
- A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks
- The Inclusion Problem for Regular Expressions
- Learnability of Automatic Classes
- Untestable Properties Expressible with Four First-Order Quantifiers
- The Copying Power of Well-Nested Multiple Context-Free Grammars
- Post Correspondence Problem with Partially Commutative Alphabets
- Reversible Pushdown Automata
- String Extension Learning Using Lattices
- The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape
- Primitive Words Are Unavoidable for Context-Free Languages
- Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness
- Hard Counting Problems for Partial Words
- Exact Analysis of Horspool’s and Sunday’s Pattern Matching Algorithms with Probabilistic Arithmetic Automata
- SA-REPC – Sequence Alignment with Regular Expression Path Constraint
- CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
- A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems
- Using Sums-of-Products for Non-standard Reasoning
- Restarting Automata with Structured Output and Functional Generative Description
- A Randomized Numerical Aligner (rNA)
- Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
- Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
- Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem
- Variable Automata over Infinite Alphabets
- Some Minimality Results on Biresidual and Biseparable Automata
- Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
- Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages
- Complexity of Guided Insertion-Deletion in RNA-Editing.
