Cargando…

Implementation and Applications of Automata 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008, Proceedings /

This book constitutes the thoroughly refereed post-proceedings of the 13th International Conference on Implementation and Application of Automata, CIAA 2008, held in San Francisco, USA, in July 2008. The 26 revised full papers togehter with 4 invited papers were carefully reviewed and selected from...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Ibarra, Oscar H. (Editor ), Ravikumar, Bala (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
Edición:1st ed. 2008.
Colección:Theoretical Computer Science and General Issues, 5148
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-70844-5
003 DE-He213
005 20230222034502.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 |a 9783540708445  |9 978-3-540-70844-5 
024 7 |a 10.1007/978-3-540-70844-5  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM037000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Implementation and Applications of Automata  |h [electronic resource] :  |b 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008, Proceedings /  |c edited by Oscar H. Ibarra, Bala Ravikumar. 
250 |a 1st ed. 2008. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2008. 
300 |a XIII, 289 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 5148 
505 0 |a Invited Lectures -- Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity -- Language Decompositions, Primality, and Trajectory-Based Operations -- Automata, Probability, and Recursion -- Concurrency, Synchronization, and Conflicts in Petri Nets -- Technical Contributions -- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties -- Antimirov and Mosses's Rewrite System Revisited -- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata -- Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) -- Hopcroft's Minimization Technique: Queues or Stacks? -- Learning Regular Languages Using Nondeterministic Finite Automata -- Multi-Return Macro Tree Transducers -- Computing Convex Hulls by Automata Iteration -- A Translation from the HTML DTD into a Regular Hedge Grammar -- Tree-Series-to-Tree-Series Transformations -- Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning -- Pattern Matching in DCA Coded Text -- Five Determinisation Algorithms -- Persistent Computations of Turing Machines -- On Complexity of Two Dimensional Languages Generated by Transducers -- Games for Temporal Logics on Trees -- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata -- Composed Bisimulation for Tree Automata -- Hyper-Minimization in O(n 2) -- Deterministic Pushdown Automata and Unary Languages -- Finite Eilenberg Machines -- The Number of Runs in Sturmian Words -- 3-Way Composition of Weighted Finite-State Transducers -- Progressive Solutions to FSM Equations -- Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees -- Approximate Periods with Levenshtein Distance. 
520 |a This book constitutes the thoroughly refereed post-proceedings of the 13th International Conference on Implementation and Application of Automata, CIAA 2008, held in San Francisco, USA, in July 2008. The 26 revised full papers togehter with 4 invited papers were carefully reviewed and selected from 40 submissions and have gone through two rounds of reviewing and improvement. The papers cover various topics in the theory, implementation, and applications of automata and related structures. 
650 0 |a Computer science. 
650 0 |a Computer programming. 
650 0 |a Compilers (Computer programs). 
650 0 |a Algorithms. 
650 0 |a Machine theory. 
650 1 4 |a Theory of Computation. 
650 2 4 |a Programming Techniques. 
650 2 4 |a Compilers and Interpreters. 
650 2 4 |a Algorithms. 
650 2 4 |a Computer Science Logic and Foundations of Programming. 
650 2 4 |a Formal Languages and Automata Theory. 
700 1 |a Ibarra, Oscar H.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Ravikumar, Bala.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540867067 
776 0 8 |i Printed edition:  |z 9783540708438 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 5148 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-540-70844-5  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)