|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910484987803321 |
|
|
Titolo |
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.) |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
|
|
|
|
ISBN |
|
1-280-38660-6 |
9786613564528 |
3-642-13089-5 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XIV, 622 p. 92 illus.) |
|
|
|
|
|
|
Collana |
|
Lecture notes in computer science, , 0302-9743 ; ; 6031 |
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
|
|
|
|
|
|
|
Altri autori (Persone) |
|
Horia DediuAdrian |
FernauHenning |
Martin VideCarlos |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Machine theory |
Formal languages |
Mathematical linguistics |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
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 |
|
|
|
|