|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465879103316 |
|
|
Titolo |
Language and Automata Theory and Applications [[electronic resource] ] : 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010, Proceedings / / edited by Carlos Martin-Vide, Henning Fernau, Adrian Horia Dediu |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
|
|
|
|
|
|
|
|
|
ISBN |
|
1-280-38660-6 |
9786613564528 |
3-642-13089-5 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2010.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XIV, 622 p. 92 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 6031 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer programming |
Compilers (Computer programs) |
Pattern recognition systems |
Computer science |
Algorithms |
Artificial intelligence |
Programming Techniques |
Compilers and Interpreters |
Automated Pattern Recognition |
Theory of Computation |
Artificial Intelligence |
|
|
|
|
|
|
|
|
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 |
|
|
|
|