| 000 | 05746nam a22006255i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-13089-2 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125827.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100509s2010 gw | s |||| 0|eng d | ||
| 020 |
_a9783642130892 _9978-3-642-13089-2 |
||
| 024 | 7 |
_a10.1007/978-3-642-13089-2 _2doi |
|
| 050 | 4 | _aQA76.6-76.66 | |
| 072 | 7 |
_aUM _2bicssc |
|
| 072 | 7 |
_aCOM051000 _2bisacsh |
|
| 072 | 7 |
_aUM _2thema |
|
| 082 | 0 | 4 |
_a005.11 _223 |
| 245 | 1 | 0 |
_aLanguage and Automata Theory and Applications _h[electronic resource] : _b4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010, Proceedings / _cedited by Carlos Martin-Vide, Henning Fernau, Adrian Horia Dediu. |
| 250 | _a1st ed. 2010. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
| 300 |
_aXIV, 622 p. 92 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6031 |
|
| 505 | 0 | _aInvited 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 -- StringExtension 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. | |
| 650 | 0 | _aComputer programming. | |
| 650 | 0 | _aCompilers (Computer programs). | |
| 650 | 0 | _aPattern recognition systems. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 1 | 4 | _aProgramming Techniques. |
| 650 | 2 | 4 | _aCompilers and Interpreters. |
| 650 | 2 | 4 | _aAutomated Pattern Recognition. |
| 650 | 2 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aArtificial Intelligence. |
| 700 | 1 |
_aMartin-Vide, Carlos. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aFernau, Henning. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aDediu, Adrian Horia. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642130885 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642130908 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6031 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-13089-2 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cSPRINGER | ||
| 999 |
_c182113 _d182113 |
||