Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Language and automata theory and applications : 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010 : proceedings / / Adrian Horia Dediu, Henning Fernau, Carlos Martin-Vide (eds.)
| Language and automata theory and applications : 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010 : proceedings / / Adrian Horia Dediu, Henning Fernau, Carlos Martin-Vide (eds.) |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XIV, 622 p. 92 illus.) |
| Disciplina | 410.1/15 |
| Altri autori (Persone) |
Horia DediuAdrian
FernauHenning Martin VideCarlos |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Machine theory
Formal languages Mathematical linguistics |
| ISBN |
1-280-38660-6
9786613564528 3-642-13089-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910484987803321 |
| Berlin, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Language and automata theory and applications : third international conference, LATA 2009, Tarragona, Spain, April 2-8, 2009 : proceedings / / Adrian Horia Dediu, Armand Mihai Ionescu, Carlos Martin-Vide (eds.)
| Language and automata theory and applications : third international conference, LATA 2009, Tarragona, Spain, April 2-8, 2009 : proceedings / / Adrian Horia Dediu, Armand Mihai Ionescu, Carlos Martin-Vide (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XV, 754 p.) |
| Disciplina | 005.131 |
| Altri autori (Persone) |
Horia DediuAdrian
Martin VideCarlos Mihai IonescuArmand |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Formal languages
Machine theory |
| ISBN | 3-642-00982-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Recent Developments in Algorithmic Teaching -- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications -- Descriptional and Computational Complexity of Finite Automata -- Hypothesis Spaces for Learning -- State Complexity of Nested Word Automata -- Regular Papers -- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations -- Minimal Union-Free Decompositions of Regular Languages -- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory -- Matching Trace Patterns with Regular Policies -- Absolute Convergence of Rational Series Is Semi-decidable -- Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG] -- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights -- Refinement and Consistency of Timed Modal Specifications -- Nondeterministic Instance Complexity and Proof Systems with Advice -- How Many Holes Can an Unbordered Partial Word Contain? -- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms -- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization -- Larger Lower Bounds on the OBDD Complexity of Integer Multiplication -- Picture Languages Generated by Assembling Tiles -- Undecidability of Operation Problems for T0L Languages and Subclasses -- Decision Problems for Convex Languages -- On a Family of Morphic Images of Arnoux-Rauzy Words -- Monadic Datalog Tree Transducers -- On Extended Regular Expressions -- Multi-tilde Operators and Their Glushkov Automata -- Non-uniform Cellular Automata -- A Cryptosystem Based on the Composition of Reversible Cellular Automata -- Grammars Controlled by Special Petri Nets -- Nested Counters in Bit-Parallel String Matching -- Bounded Delay and Concurrency for Earliest Query Answering -- Learning by Erasing in Dynamic Epistemic Logic -- The Fault Tolerance of NP-Hard Problems -- Termination of Priority Rewriting -- State Complexity of Combined Operations for Prefix-Free Regular Languages -- Towards a Taxonomy for ECFG and RRPG Parsing -- Counting Parameterized Border Arrays for a Binary Alphabet -- Bounded Hairpin Completion -- Rigid Tree Automata -- Converting Self-verifying Automata into Deterministic Automata -- Two Equivalent Regularizations for Tree Adjoining Grammars -- Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching -- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata -- Automata on Gauss Words -- Analysing Complexity in Classes of Unary Automatic Structures -- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words -- Segmentation Charts for Czech – Relations among Segments in Complex Sentences -- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions -- Efficiency of the Symmetry Bias in Grammar Acquisition -- A Series of Run-Rich Strings -- On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes -- The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates -- Prediction of Creole Emergence in Spatial Language Dynamics -- On the Average Size of Glushkov’s Automata -- Tiling the Plane with a Fixed Number of Polyominoes -- New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality -- On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata -- Finitely Generated Synchronizing Automata -- Genetic Algorithm for Synchronization -- Constructing Infinite Words of Intermediate Arithmetical Complexity -- From Gene Trees to Species Trees through a Supertree Approach -- A Kleene Theorem for Forest Languages -- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions -- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit. |
| Altri titoli varianti | LATA 2009 |
| Record Nr. | UNINA-9910483466003321 |
| Berlin ; ; New York, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||