top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Formal and Natural Computing [[electronic resource] ] : Essays Dedicated to Grzegorz Rozenberg / / edited by Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto K. Salomaa
Formal and Natural Computing [[electronic resource] ] : Essays Dedicated to Grzegorz Rozenberg / / edited by Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto K. Salomaa
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (XXXVI, 436 p.)
Disciplina 005.13
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Architecture, Computer
Computers
Algorithms
Computer logic
Data structures (Computer science)
Programming Techniques
Computer System Implementation
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
Logics and Meanings of Programs
Data Structures
ISBN 3-540-45711-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Words, Languages, Automata -- Balanced Grammars and Their Languages -- Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids -- The Delta Operation: From Strings to Trees to Strings -- Infinite Solutions of Marked Post Correspondence Problem -- The Branching Point Approach to Conway’s Problem -- A Survey of Some Quantitative Approaches to the Notion of Information -- Nondeterministic Trajectories -- Binary Patterns in Infinite Binary Words -- Graph Transformations -- A Sight-seeing Tour of the Computational Landscape of Graph Transformation -- Local Action Systems and DPO Graph Transformation -- Bisimulation Equivalences for Graph Grammars -- Petri Nets -- High-Level Net Processes -- Petri Net Control for Grammar Systems -- Regular Event Structures and Finite Petri Nets: A Conjecture -- Concurrent Computing -- Towards Team-Automata-Driven Object-Oriented Collaborative Work -- Grammars as Processes -- Temporal Concurrent Constraint Programming: Applications and Behavior -- Molecular Computing -- Rewriting P Systems with Conditional Communication -- An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation -- Upper Bounds for Restricted Splicing -- Codes, Involutions, and DNA Encodings -- DNA Manipulations in Ciliates -- A Magic Pot : Self-assembly Computation Revisited.
Record Nr. UNISA-996466036103316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Formal and Natural Computing : Essays Dedicated to Grzegorz Rozenberg / / edited by Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto K. Salomaa
Formal and Natural Computing : Essays Dedicated to Grzegorz Rozenberg / / edited by Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto K. Salomaa
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (XXXVI, 436 p.)
Disciplina 005.13
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Architecture, Computer
Computers
Algorithms
Computer logic
Data structures (Computer science)
Programming Techniques
Computer System Implementation
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
Logics and Meanings of Programs
Data Structures
ISBN 3-540-45711-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Words, Languages, Automata -- Balanced Grammars and Their Languages -- Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids -- The Delta Operation: From Strings to Trees to Strings -- Infinite Solutions of Marked Post Correspondence Problem -- The Branching Point Approach to Conway’s Problem -- A Survey of Some Quantitative Approaches to the Notion of Information -- Nondeterministic Trajectories -- Binary Patterns in Infinite Binary Words -- Graph Transformations -- A Sight-seeing Tour of the Computational Landscape of Graph Transformation -- Local Action Systems and DPO Graph Transformation -- Bisimulation Equivalences for Graph Grammars -- Petri Nets -- High-Level Net Processes -- Petri Net Control for Grammar Systems -- Regular Event Structures and Finite Petri Nets: A Conjecture -- Concurrent Computing -- Towards Team-Automata-Driven Object-Oriented Collaborative Work -- Grammars as Processes -- Temporal Concurrent Constraint Programming: Applications and Behavior -- Molecular Computing -- Rewriting P Systems with Conditional Communication -- An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation -- Upper Bounds for Restricted Splicing -- Codes, Involutions, and DNA Encodings -- DNA Manipulations in Ciliates -- A Magic Pot : Self-assembly Computation Revisited.
Record Nr. UNINA-9910145794203321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui