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.
Descriptional complexity of formal systems : 24th IFIP WG 1. 02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, proceedings / / edited by Yo-Sub Han and György Vaszil
| Descriptional complexity of formal systems : 24th IFIP WG 1. 02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, proceedings / / edited by Yo-Sub Han and György Vaszil |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (239 pages) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Formal methods (Computer science)
Computational complexity |
| ISBN | 3-031-13257-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910586630003321 |
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Descriptional complexity of formal systems : 24th IFIP WG 1. 02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, proceedings / / edited by Yo-Sub Han and György Vaszil
| Descriptional complexity of formal systems : 24th IFIP WG 1. 02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, proceedings / / edited by Yo-Sub Han and György Vaszil |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (239 pages) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Formal methods (Computer science)
Computational complexity |
| ISBN | 3-031-13257-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996485664403316 |
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Machines, computations, and universality : 9th international conference, MCU 2022, Debrecen, Hungary, August 31-September 2, 2022, proceedings / / edited by Jérôme Durand-Lose and György Vaszil
| Machines, computations, and universality : 9th international conference, MCU 2022, Debrecen, Hungary, August 31-September 2, 2022, proceedings / / edited by Jérôme Durand-Lose and György Vaszil |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (203 pages) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Computer science |
| ISBN | 3-031-13502-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Invited Abstracts -- Using Interference to Boost Computing -- Super Turing Computing Enables Lifelong Learning AI -- Contents -- Complexity of Local, Global and Universality Properties in Finite Dynamical Systems -- 1 Introduction -- 2 Basic Notions -- 3 fDDS Properties and Their Complexity -- 4 Universality -- 5 Additive fDDS -- 6 Conclusions and Perspectives -- References -- A Survey on Computationally Complete Accepting and Generating Networks of Evolutionary Processors -- 1 Introduction -- 2 Definitions -- 3 Restrictions Without Decreasing Computational Power -- 3.1 Number of Processors -- 3.2 Number of Production Rule Types -- 3.3 Restrictions to the Filters -- 4 Further Research -- References -- Prescribed Teams of Rules Working on Several Objects -- 1 Introduction -- 2 Definitions -- 2.1 Systems with Prescribed Teams of Rules -- 2.2 Matrix Grammars Working on Several Objects -- 2.3 Turing Machines -- 3 Prescribed Teams of Rules on Strings -- 3.1 Definitions for Prescribed Teams of Insertion and Deletion Rules on Strings -- 3.2 Results for Prescribed Teams of Insertion and Deletion Rules on Strings -- 3.3 Complexity Considerations for Prescribed Teams of Rules on Strings -- 4 Conclusion -- References -- From Networks of Reaction Systems to Communicating Reaction Systems and Back -- 1 Introduction -- 2 Reaction Systems -- 3 Networks of Reaction Systems -- 4 Communicating Reaction Systems -- 5 Connections Between RS Networks and CdcR Systems -- 6 Conclusion -- References -- A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations -- 1 Introduction -- 2 Some Concepts from the Theory of Discrete ODEs -- 3 Some Concepts from Computable Analysis -- 4 Functions from LDL are in FPTIME -- 5 Functions from FPTIME are in LDL.
6 Towards Functions from Integers to the Reals -- 7 Proving Theorems 4 and 5 -- 8 Generalizations -- 9 Conclusion and Future Work -- 10 Thanks -- References -- Languages of Distributed Reaction Systems -- 1 Introduction -- 2 Basic Notions and Notations -- 2.1 Formal Language Theory Prerequisites -- 2.2 Distributed Reaction Systems -- 3 Languages of Extended Distributed Reaction Systems -- 4 Conclusions -- References -- PSPACE-Completeness of Reversible Deterministic Systems -- 1 Introduction -- 2 The Framework -- 2.1 Required Gadgets -- 2.2 PSPACE-Hardness -- 3 Deterministic Constraint Logic -- 3.1 Issue with Existing Proof -- 3.2 PSPACE-Hardness -- 4 Billiard Balls -- References -- From Finite Automata to Fractal Automata - The Power of Recursion -- 1 Introduction -- 2 Basic Definitions -- 3 Regular Languages -- 4 The Context-Free Case -- 5 Properties of the Fractal Automata -- 6 Conclusions -- References -- Closure Properties of Subregular Languages Under Operations -- 1 Introduction -- 2 Preliminaries -- 3 Results -- 4 Conclusions -- References -- P Systems with Evolutional Communication and Separation Rules -- 1 Introduction -- 2 Preliminaries -- 2.1 Alphabets and Sets -- 2.2 Propositional Boolean Logic -- 2.3 Cantor Pairing Function -- 3 Recognizer Cell-Like Membrane Systems with Evolutional Symport/Antiport and Separation Rules -- 4 A Solution to SAT in CSEC(2, 2) -- 4.1 Overview of the Computations -- 5 Conclusions and Future Work -- References -- Computational Universality and Efficiency in Morphogenetic Systems -- 1 Introduction -- 2 Morphogenetic Systems -- 2.1 Polytopic Tiling -- 2.2 M System -- 2.3 Computation of the M System -- 2.4 Example -- 3 Small Universal M Systems -- 3.1 Self-healing Universal M System -- 4 P Versus NP in Morphogenetic Systems -- 4.1 M Systems with Mass -- 5 Conclusions -- References. Adaptive Experiments for State Identification in Finite State Machines with Timeouts -- 1 Introduction -- 2 Preliminaries -- 2.1 Finite State Machines -- 2.2 Timed Finite State Machines -- 3 Adaptive Homing Sequences for an FSM with Timeouts -- 3.1 Homing Test Case for an FSM -- 3.2 Homing Test Case for an FSM with Timeouts -- 4 Homing Test Case Derivation -- 4.1 FSM Abstraction -- 4.2 Algorithm for Checking the Existence and Derivation of an Adaptive HS for FSM -- 4.3 Algorithm for Checking the Existence and Derivation of a Homing Timed Test Case -- 5 Checking the Existence and Derivation of an Adaptive Synchronizing Sequence for an FSM with Timeouts -- 6 Conclusions -- References -- Author Index. |
| Record Nr. | UNISA-996485670203316 |
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Machines, computations, and universality : 9th international conference, MCU 2022, Debrecen, Hungary, August 31-September 2, 2022, proceedings / / edited by Jérôme Durand-Lose and György Vaszil
| Machines, computations, and universality : 9th international conference, MCU 2022, Debrecen, Hungary, August 31-September 2, 2022, proceedings / / edited by Jérôme Durand-Lose and György Vaszil |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (203 pages) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Computer science |
| ISBN | 3-031-13502-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Invited Abstracts -- Using Interference to Boost Computing -- Super Turing Computing Enables Lifelong Learning AI -- Contents -- Complexity of Local, Global and Universality Properties in Finite Dynamical Systems -- 1 Introduction -- 2 Basic Notions -- 3 fDDS Properties and Their Complexity -- 4 Universality -- 5 Additive fDDS -- 6 Conclusions and Perspectives -- References -- A Survey on Computationally Complete Accepting and Generating Networks of Evolutionary Processors -- 1 Introduction -- 2 Definitions -- 3 Restrictions Without Decreasing Computational Power -- 3.1 Number of Processors -- 3.2 Number of Production Rule Types -- 3.3 Restrictions to the Filters -- 4 Further Research -- References -- Prescribed Teams of Rules Working on Several Objects -- 1 Introduction -- 2 Definitions -- 2.1 Systems with Prescribed Teams of Rules -- 2.2 Matrix Grammars Working on Several Objects -- 2.3 Turing Machines -- 3 Prescribed Teams of Rules on Strings -- 3.1 Definitions for Prescribed Teams of Insertion and Deletion Rules on Strings -- 3.2 Results for Prescribed Teams of Insertion and Deletion Rules on Strings -- 3.3 Complexity Considerations for Prescribed Teams of Rules on Strings -- 4 Conclusion -- References -- From Networks of Reaction Systems to Communicating Reaction Systems and Back -- 1 Introduction -- 2 Reaction Systems -- 3 Networks of Reaction Systems -- 4 Communicating Reaction Systems -- 5 Connections Between RS Networks and CdcR Systems -- 6 Conclusion -- References -- A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations -- 1 Introduction -- 2 Some Concepts from the Theory of Discrete ODEs -- 3 Some Concepts from Computable Analysis -- 4 Functions from LDL are in FPTIME -- 5 Functions from FPTIME are in LDL.
6 Towards Functions from Integers to the Reals -- 7 Proving Theorems 4 and 5 -- 8 Generalizations -- 9 Conclusion and Future Work -- 10 Thanks -- References -- Languages of Distributed Reaction Systems -- 1 Introduction -- 2 Basic Notions and Notations -- 2.1 Formal Language Theory Prerequisites -- 2.2 Distributed Reaction Systems -- 3 Languages of Extended Distributed Reaction Systems -- 4 Conclusions -- References -- PSPACE-Completeness of Reversible Deterministic Systems -- 1 Introduction -- 2 The Framework -- 2.1 Required Gadgets -- 2.2 PSPACE-Hardness -- 3 Deterministic Constraint Logic -- 3.1 Issue with Existing Proof -- 3.2 PSPACE-Hardness -- 4 Billiard Balls -- References -- From Finite Automata to Fractal Automata - The Power of Recursion -- 1 Introduction -- 2 Basic Definitions -- 3 Regular Languages -- 4 The Context-Free Case -- 5 Properties of the Fractal Automata -- 6 Conclusions -- References -- Closure Properties of Subregular Languages Under Operations -- 1 Introduction -- 2 Preliminaries -- 3 Results -- 4 Conclusions -- References -- P Systems with Evolutional Communication and Separation Rules -- 1 Introduction -- 2 Preliminaries -- 2.1 Alphabets and Sets -- 2.2 Propositional Boolean Logic -- 2.3 Cantor Pairing Function -- 3 Recognizer Cell-Like Membrane Systems with Evolutional Symport/Antiport and Separation Rules -- 4 A Solution to SAT in CSEC(2, 2) -- 4.1 Overview of the Computations -- 5 Conclusions and Future Work -- References -- Computational Universality and Efficiency in Morphogenetic Systems -- 1 Introduction -- 2 Morphogenetic Systems -- 2.1 Polytopic Tiling -- 2.2 M System -- 2.3 Computation of the M System -- 2.4 Example -- 3 Small Universal M Systems -- 3.1 Self-healing Universal M System -- 4 P Versus NP in Morphogenetic Systems -- 4.1 M Systems with Mass -- 5 Conclusions -- References. Adaptive Experiments for State Identification in Finite State Machines with Timeouts -- 1 Introduction -- 2 Preliminaries -- 2.1 Finite State Machines -- 2.2 Timed Finite State Machines -- 3 Adaptive Homing Sequences for an FSM with Timeouts -- 3.1 Homing Test Case for an FSM -- 3.2 Homing Test Case for an FSM with Timeouts -- 4 Homing Test Case Derivation -- 4.1 FSM Abstraction -- 4.2 Algorithm for Checking the Existence and Derivation of an Adaptive HS for FSM -- 4.3 Algorithm for Checking the Existence and Derivation of a Homing Timed Test Case -- 5 Checking the Existence and Derivation of an Adaptive Synchronizing Sequence for an FSM with Timeouts -- 6 Conclusions -- References -- Author Index. |
| Record Nr. | UNINA-9910586587603321 |
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||