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.
Automated Technology for Verification and Analysis [[electronic resource] ] : 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012, Proceedings / / edited by Madhavan Mukund, Supratik Chakraborty
| Automated Technology for Verification and Analysis [[electronic resource] ] : 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012, Proceedings / / edited by Madhavan Mukund, Supratik Chakraborty |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XIV, 438 p. 106 illus.) |
| Disciplina | 006.3 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Computer programming Computer communication systems Computer logic Programming languages (Electronic computers) Software Engineering Programming Techniques Computer Communication Networks Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Software Engineering/Programming and Operating Systems |
| ISBN | 3-642-33386-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466208503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal models, languages and applications [[electronic resource] /] / editors, K.G. Subramanian, K. Rangarajan, M. Mukund
| Formal models, languages and applications [[electronic resource] /] / editors, K.G. Subramanian, K. Rangarajan, M. Mukund |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ., : World Scientific, c2006 |
| Descrizione fisica | 1 online resource (420 p.) |
| Disciplina | 004 |
| Altri autori (Persone) |
MukundMadhavan
RangarajanK SubramanianK. G |
| Collana | Series in machine perception and artificial intelligence |
| Soggetto topico |
Compilers (Computer programs)
Computational complexity Formal languages |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-37321-4
9786611373214 981-277-303-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface ; Ch. 1 Finite Array Automata and Regular Array Grammars .-- ; 1 Introduction .-- ; 2 Preliminaries.-- ; 3 Finite Array Automata.-- ; 4 Regular Array Languages and Pumping Lemma.-- ; 5 Control on Regular Array grammars.-- ; 6 Final Remarks.-- References ; Ch. 2 L-Convex Polyominoes: A Survey .-- ; 1 Introduction .-- ; 2 Definitions and Preliminaries on L-convex Polyominoes.-- ; 3 Discrete Tomography.-- ; 4 L-convex Polyominoes with Respect to Subpicture Order.-- ; 5 Enumerating L-Convex Polyominoes .-- References ; Ch. 3 On Oriented Labelling Parameters .-- ; 1 Introduction .-- ; 2 Oriented Vertex Partitioning Problems.-- ; 3 Notation and Terminology .-- ; 4 Two Oriented Variations of L(p g)-Labelling.-- ; 5 Oriented L(p q)-Labelling for Trees.-- ; 6 Oriented L(p 1)-Labelling of Bipartite Graphs.-- ; 7 Oriented L(p 1)-Labelling and the Acyclic Chromatic Number .-- ; 8 L(p q)-Labelling of Oriented Graphs.-- ; 9 Conclusion .-- References ; Ch. 4 On a Variant of Parallel Communicating Grammar Systems with Communication by Command .-- ; 1 Introduction .-- ; 2 Basic Notions and Definitions.-- ; 3 On the Power of FCCPC Grammar Systems4 On the Efficiency of FCCPC Grammar Systems .-- ; 5 Final Remarks.-- References ; Ch. 5 Some Remarks on Homogeneous Generating Networks of Free Evolutionary Processors.-- ; 1 Introduction .-- ; 2 Basic Definitions.-- ; 3 Computational Power of HGNFEPs.-- ; 4 Conclusion |
| Record Nr. | UNINA-9910451099903321 |
| Singapore ; ; Hackensack, NJ., : World Scientific, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Formal models, languages and applications [[electronic resource] /] / editors, K.G. Subramanian, K. Rangarajan, M. Mukund
| Formal models, languages and applications [[electronic resource] /] / editors, K.G. Subramanian, K. Rangarajan, M. Mukund |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ., : World Scientific, c2006 |
| Descrizione fisica | 1 online resource (420 p.) |
| Disciplina | 004 |
| Altri autori (Persone) |
MukundMadhavan
RangarajanK SubramanianK. G |
| Collana | Series in machine perception and artificial intelligence |
| Soggetto topico |
Compilers (Computer programs)
Computational complexity Formal languages |
| ISBN |
1-281-37321-4
9786611373214 981-277-303-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface ; Ch. 1 Finite Array Automata and Regular Array Grammars .-- ; 1 Introduction .-- ; 2 Preliminaries.-- ; 3 Finite Array Automata.-- ; 4 Regular Array Languages and Pumping Lemma.-- ; 5 Control on Regular Array grammars.-- ; 6 Final Remarks.-- References ; Ch. 2 L-Convex Polyominoes: A Survey .-- ; 1 Introduction .-- ; 2 Definitions and Preliminaries on L-convex Polyominoes.-- ; 3 Discrete Tomography.-- ; 4 L-convex Polyominoes with Respect to Subpicture Order.-- ; 5 Enumerating L-Convex Polyominoes .-- References ; Ch. 3 On Oriented Labelling Parameters .-- ; 1 Introduction .-- ; 2 Oriented Vertex Partitioning Problems.-- ; 3 Notation and Terminology .-- ; 4 Two Oriented Variations of L(p g)-Labelling.-- ; 5 Oriented L(p q)-Labelling for Trees.-- ; 6 Oriented L(p 1)-Labelling of Bipartite Graphs.-- ; 7 Oriented L(p 1)-Labelling and the Acyclic Chromatic Number .-- ; 8 L(p q)-Labelling of Oriented Graphs.-- ; 9 Conclusion .-- References ; Ch. 4 On a Variant of Parallel Communicating Grammar Systems with Communication by Command .-- ; 1 Introduction .-- ; 2 Basic Notions and Definitions.-- ; 3 On the Power of FCCPC Grammar Systems4 On the Efficiency of FCCPC Grammar Systems .-- ; 5 Final Remarks.-- References ; Ch. 5 Some Remarks on Homogeneous Generating Networks of Free Evolutionary Processors.-- ; 1 Introduction .-- ; 2 Basic Definitions.-- ; 3 Computational Power of HGNFEPs.-- ; 4 Conclusion |
| Record Nr. | UNINA-9910784961303321 |
| Singapore ; ; Hackensack, NJ., : World Scientific, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings / / edited by Ramesh Hariharan, Madhavan Mukund, V. Vinay
| FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings / / edited by Ramesh Hariharan, Madhavan Mukund, V. Vinay |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 352 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Application software Computer logic Programming languages (Electronic computers) Mathematical logic Theory of Computation Software Engineering/Programming and Operating Systems Computer Applications Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages |
| ISBN | 3-540-45294-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity -- Approximation Schemes for Geometric NP-Hard Problems: A Survey -- On Clustering Using Random Walks -- An Introduction to Decidability of DPDA Equivalence -- Semidefinite Programming Based Approximation Algorithms -- Contributed Papers -- Hard Sets and Pseudo-random Generators for Constant Depth Circuits -- The First-Order Isomorphism Theorem -- Thresholds and Optimal Binary Comparison Search Trees -- Distributed LTL Model Checking Based on Negative Cycle Detection -- Computability and Complexity Results for a Spatial Assertion Language for Data Structures -- Using Nondeterminism to Design Efficient Deterministic Algorithms -- Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter -- A Mechanically Verified Compiling Specification for a Lisp Compiler -- Beyond Regular Model Checking -- Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity -- Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel -- List Decoding from Erasures: Bounds and Code Constructions -- Verification of a Leader Election Algorithm in Timed Asynchronous Systems -- Efficient Addition on Field Programmable Gate Arrays -- The Directed Minimum-Degree Spanning Tree Problem -- I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems -- Beyond Message Sequence Graphs -- Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints -- Properties of Distributed Timed-Arc Petri Nets -- From Falsification to Verification -- On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems -- Range Allocation for Equivalence Logic -- Rewrite Closure for Ground and Cancellative AC Theories. |
| Record Nr. | UNISA-996465672703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science : 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings / / edited by Ramesh Hariharan, Madhavan Mukund, V. Vinay
| FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science : 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings / / edited by Ramesh Hariharan, Madhavan Mukund, V. Vinay |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 352 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Application software Computer logic Programming languages (Electronic computers) Logic, Symbolic and mathematical Theory of Computation Software Engineering/Programming and Operating Systems Computer Applications Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages |
| ISBN | 3-540-45294-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity -- Approximation Schemes for Geometric NP-Hard Problems: A Survey -- On Clustering Using Random Walks -- An Introduction to Decidability of DPDA Equivalence -- Semidefinite Programming Based Approximation Algorithms -- Contributed Papers -- Hard Sets and Pseudo-random Generators for Constant Depth Circuits -- The First-Order Isomorphism Theorem -- Thresholds and Optimal Binary Comparison Search Trees -- Distributed LTL Model Checking Based on Negative Cycle Detection -- Computability and Complexity Results for a Spatial Assertion Language for Data Structures -- Using Nondeterminism to Design Efficient Deterministic Algorithms -- Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter -- A Mechanically Verified Compiling Specification for a Lisp Compiler -- Beyond Regular Model Checking -- Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity -- Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel -- List Decoding from Erasures: Bounds and Code Constructions -- Verification of a Leader Election Algorithm in Timed Asynchronous Systems -- Efficient Addition on Field Programmable Gate Arrays -- The Directed Minimum-Degree Spanning Tree Problem -- I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems -- Beyond Message Sequence Graphs -- Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints -- Properties of Distributed Timed-Arc Petri Nets -- From Falsification to Verification -- On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems -- Range Allocation for Equivalence Logic -- Rewrite Closure for Ground and Cancellative AC Theories. |
| Record Nr. | UNINA-9910143920803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||