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.
Algebraic Foundations in Computer Science [[electronic resource] ] : Essays Dedicated to Symeon Bozapalidis on the Occasion of His Retirement / / edited by Werner Kuich, George Rahonis
| Algebraic Foundations in Computer Science [[electronic resource] ] : Essays Dedicated to Symeon Bozapalidis on the Occasion of His Retirement / / edited by Werner Kuich, George Rahonis |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (X, 363 p.) |
| Disciplina | 004.01512 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Artificial intelligence Compilers (Computer programs) Computer science—Mathematics Software engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence Compilers and Interpreters Symbolic and Algebraic Manipulation Software Engineering |
| ISBN | 3-642-24897-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Selected Decision Problems for Square-Refinement Collage Grammars -- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics -- Partial Conway and Iteration Semiring-Semimodule Pairs -- Kleene Theorem in Partial Conway Theories with Applications -- Rational Transformations and a Kleene Theorem for Power Series over Rational Monoids -- Equational Weighted Tree Transformations with Discounting -- Quantum Automata Theory – A Review -- Graph Automata: The Algebraic Properties of Abelian Relational Graphoids -- A Survey on Picture-Walking Automata -- Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups -- Algebraic Systems and Pushdown Automata -- Where Automatic Structures Benefit from Weighted Automata -- Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition -- Valuations of Weighted Automata: Doing It in a Rational Way -- Selected Combinatorial Properties of Random Intersection Graphs. Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics -- Partial Conway and Iteration Semiring-Semimodule Pairs -- Kleene Theorem in Partial Conway Theories with Applications -- Rational Transformations and a Kleene Theorem for Power Series over Rational Monoids -- Equational Weighted Tree Transformations with Discounting -- Quantum Automata Theory – A Review -- Graph Automata: The Algebraic Properties of Abelian Relational Graphoids -- A Survey on Picture-Walking Automata -- Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups -- Algebraic Systems and Pushdown Automata -- Where Automatic Structures Benefit from Weighted Automata -- Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition -- Valuations of Weighted Automata: Doing It in a Rational Way -- Selected Combinatorial Properties of Random Intersection Graphs. |
| Record Nr. | UNISA-996465957003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algebraic informatics : 9th International Conference, CAI 2022, virtual event, October 27-29, 2022, proceedings / / edited by Dimitrios Poulakis, George Rahonis
| Algebraic informatics : 9th International Conference, CAI 2022, virtual event, October 27-29, 2022, proceedings / / edited by Dimitrios Poulakis, George Rahonis |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (233 pages) |
| Disciplina | 069 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Algebra - Data processing |
| ISBN | 3-031-19685-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Weighted Automata Over Monotonic Strong Bimonoids: Decidability and Undecidability of Finite Image -- Constraints, Graphs, Algebra, Logic, and Complexity -- Contents -- Invited Papers -- Chaining Multiplications in Finite Fields with Chudnovsky-Type Algorithms and Tensor Rank of the k-Multiplication -- 1 Introduction -- 1.1 Context, Notation and Basic Results -- 1.2 New Results and Organisation -- 2 Theoretical Construction of a Multiplying Algorithm -- 2.1 Notations -- 2.2 Algorithm -- 3 On the Existence of These Algorithms -- 3.1 Strategy of Construction -- 3.2 Towers of Algebraic Function Fields -- 4 Uniform Upper Bounds -- References -- On Some Algebraic Ways to Calculate Zeros of the Riemann Zeta Function -- 1 The Riemann Hypothesis -- 2 The Riemann Hypothesis in the Arithmetical Hierarchy -- 3 Calculation of the Zeta Zeros by Solving Algebraic Equations -- 4 Calculation of Summands from Dirichlet Series for the Zeta Function at Its Zeros -- References -- Shuffle Product of Regular Languages: Results and Open Problems -- 1 Introduction -- 2 Shuffle and Recognition -- 2.1 Shuffle Product -- 2.2 Monoids and Ordered Monoids -- 2.3 Power Monoids and Lower Set Monoids -- 3 Classes of Languages Closed Under Shuffle -- 3.1 Varieties of Languages Closed Under Shuffle -- 3.2 Positive Varieties of Languages Closed Under Shuffle -- 3.3 Intermixed Languages -- 4 Sequential and Parallel Decompositions -- 4.1 Definitions and Examples -- 4.2 Closure Properties -- 4.3 Schnoebelen's Problem -- 5 Conclusion -- References -- Contributed Papers -- Ordering the Boolean Cube Vectors by Their Weights and with Minimal Change -- 1 Introduction -- 2 Basic Notions and Preliminary Results -- 3 Ordering the Vectors of the Boolean Cube by Their Weights and with Minimal Change.
4 Algorithm for Generating the Vectors of the Boolean Cube Ordered by Weights and with Minimal Change -- 5 Conclusions -- References -- Designated-Verifier Linkable Ring Signatures with Unconditional Anonymity -- 1 Introduction -- 2 Preliminaries -- 2.1 Notation -- 2.2 Security Assumptions -- 3 UDVLRS Definition and Security Model -- 3.1 UDVLRS Definition -- 3.2 Correctness -- 3.3 Adversarial Capabilities -- 3.4 Unforgeability -- 3.5 Anonymity -- 3.6 Non-transferability -- 3.7 Linkability -- 3.8 Non-slanderability -- 4 Our Construction -- 5 Security Analysis -- 6 Conclusion and Future Work -- References -- Finding Points on Elliptic Curves with Coppersmith's Method -- 1 Introduction -- 2 Preliminaries -- 2.1 Some ECC Cryptosystems -- 2.2 Lattice Basis Reduction and Coppersmith's Method -- 3 Small Solutions of the Elliptic Curve Equation -- 4 A Numerical Example -- 5 Conclusion -- References -- Weighted Propositional Configuration Logic over De Morgan Algebras -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 Unweighted PCL -- 5 Weighted PCL over De Morgan Algebras -- 6 Examples -- 7 Discussion -- 8 Conclusion -- References -- Weighted Two-Way Transducers -- 1 Introduction -- 2 Preliminaries -- 3 Weighted Two-Way Transducers -- 4 Relation to Unweighted Case -- 5 Closure Properties -- References -- A Formal Algebraic Approach for the Quantitative Modeling of Connectors in Architectures -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 The Weighted Algebra of Interactions -- 5 The Weighted Algebra of Connectors -- 6 On Congruence Relation for Fusion-wAC(P) Connectors -- 7 Discussion -- 8 Conclusion -- References -- Watson-Crick Powers of a Word -- 1 Introduction -- 2 Preliminaries -- 3 A Binary Operation Generating Watson-Crick Powers -- 4 Watson-Crick Conjugate Equations -- 5 Conjugacy and Commutativity with Respect to. 6 -Primitive Words, and a Word's -Primitive Root Pair -- 7 Conclusions -- References -- A Normal Form for Matrix Multiplication Schemes -- 1 Introduction -- 2 Matrix Multiplication Schemes -- 3 The Symmetry Group -- 4 Minimal Orbit Elements -- 5 Minimizing the First Row -- 6 Timings and Analysis -- References -- Bideterministic Weighted Automata -- 1 Introduction -- 2 Preliminaries -- 3 Bideterministic Weighted Automata over a Semiring -- 4 The Minimality Property of Bideterministic Automata -- 4.1 Fields and Integral Domains -- 4.2 Other Commutative Rings -- 4.3 Positive Semirings -- 5 Decidability of Bideterminisability -- 5.1 Fields -- 5.2 Tropical Semirings -- References -- How to Decide Functionality of Compositions of Top-Down Tree Transducers -- 1 Introduction -- 2 Top-Down Tree Transducers -- 3 Functionality of Two-Fold Compositions -- 3.1 Construction of the LA-Transducer M -- 3.2 Correctness of the LA-Transducer M -- 3.3 Functionality of Arbitrary Compositions -- 4 Conclusion -- References -- Computation of Solutions to Certain Nonlinear Systems of Fuzzy Relation Inequations -- 1 Introduction -- 2 Preliminaries -- 3 Certain Types of Fuzzy Relation Inequations and Their Solutions -- References -- When Variable-Length Codes Meet the Field of Error Detection -- 1 Introduction -- 2 Preliminaries -- 3 Error Detection and the Prefix Metric -- 4 Error Detection and the Factor Metric -- 5 Error Detection in the Topologies Associated to (anti-)automorphisms -- 6 Concluding Remark -- References -- Author Index. |
| Record Nr. | UNISA-996495569703316 |
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algebraic informatics : 9th International Conference, CAI 2022, virtual event, October 27-29, 2022, proceedings / / edited by Dimitrios Poulakis, George Rahonis
| Algebraic informatics : 9th International Conference, CAI 2022, virtual event, October 27-29, 2022, proceedings / / edited by Dimitrios Poulakis, George Rahonis |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (233 pages) |
| Disciplina | 069 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Algebra - Data processing |
| ISBN | 3-031-19685-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Weighted Automata Over Monotonic Strong Bimonoids: Decidability and Undecidability of Finite Image -- Constraints, Graphs, Algebra, Logic, and Complexity -- Contents -- Invited Papers -- Chaining Multiplications in Finite Fields with Chudnovsky-Type Algorithms and Tensor Rank of the k-Multiplication -- 1 Introduction -- 1.1 Context, Notation and Basic Results -- 1.2 New Results and Organisation -- 2 Theoretical Construction of a Multiplying Algorithm -- 2.1 Notations -- 2.2 Algorithm -- 3 On the Existence of These Algorithms -- 3.1 Strategy of Construction -- 3.2 Towers of Algebraic Function Fields -- 4 Uniform Upper Bounds -- References -- On Some Algebraic Ways to Calculate Zeros of the Riemann Zeta Function -- 1 The Riemann Hypothesis -- 2 The Riemann Hypothesis in the Arithmetical Hierarchy -- 3 Calculation of the Zeta Zeros by Solving Algebraic Equations -- 4 Calculation of Summands from Dirichlet Series for the Zeta Function at Its Zeros -- References -- Shuffle Product of Regular Languages: Results and Open Problems -- 1 Introduction -- 2 Shuffle and Recognition -- 2.1 Shuffle Product -- 2.2 Monoids and Ordered Monoids -- 2.3 Power Monoids and Lower Set Monoids -- 3 Classes of Languages Closed Under Shuffle -- 3.1 Varieties of Languages Closed Under Shuffle -- 3.2 Positive Varieties of Languages Closed Under Shuffle -- 3.3 Intermixed Languages -- 4 Sequential and Parallel Decompositions -- 4.1 Definitions and Examples -- 4.2 Closure Properties -- 4.3 Schnoebelen's Problem -- 5 Conclusion -- References -- Contributed Papers -- Ordering the Boolean Cube Vectors by Their Weights and with Minimal Change -- 1 Introduction -- 2 Basic Notions and Preliminary Results -- 3 Ordering the Vectors of the Boolean Cube by Their Weights and with Minimal Change.
4 Algorithm for Generating the Vectors of the Boolean Cube Ordered by Weights and with Minimal Change -- 5 Conclusions -- References -- Designated-Verifier Linkable Ring Signatures with Unconditional Anonymity -- 1 Introduction -- 2 Preliminaries -- 2.1 Notation -- 2.2 Security Assumptions -- 3 UDVLRS Definition and Security Model -- 3.1 UDVLRS Definition -- 3.2 Correctness -- 3.3 Adversarial Capabilities -- 3.4 Unforgeability -- 3.5 Anonymity -- 3.6 Non-transferability -- 3.7 Linkability -- 3.8 Non-slanderability -- 4 Our Construction -- 5 Security Analysis -- 6 Conclusion and Future Work -- References -- Finding Points on Elliptic Curves with Coppersmith's Method -- 1 Introduction -- 2 Preliminaries -- 2.1 Some ECC Cryptosystems -- 2.2 Lattice Basis Reduction and Coppersmith's Method -- 3 Small Solutions of the Elliptic Curve Equation -- 4 A Numerical Example -- 5 Conclusion -- References -- Weighted Propositional Configuration Logic over De Morgan Algebras -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 Unweighted PCL -- 5 Weighted PCL over De Morgan Algebras -- 6 Examples -- 7 Discussion -- 8 Conclusion -- References -- Weighted Two-Way Transducers -- 1 Introduction -- 2 Preliminaries -- 3 Weighted Two-Way Transducers -- 4 Relation to Unweighted Case -- 5 Closure Properties -- References -- A Formal Algebraic Approach for the Quantitative Modeling of Connectors in Architectures -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 The Weighted Algebra of Interactions -- 5 The Weighted Algebra of Connectors -- 6 On Congruence Relation for Fusion-wAC(P) Connectors -- 7 Discussion -- 8 Conclusion -- References -- Watson-Crick Powers of a Word -- 1 Introduction -- 2 Preliminaries -- 3 A Binary Operation Generating Watson-Crick Powers -- 4 Watson-Crick Conjugate Equations -- 5 Conjugacy and Commutativity with Respect to. 6 -Primitive Words, and a Word's -Primitive Root Pair -- 7 Conclusions -- References -- A Normal Form for Matrix Multiplication Schemes -- 1 Introduction -- 2 Matrix Multiplication Schemes -- 3 The Symmetry Group -- 4 Minimal Orbit Elements -- 5 Minimizing the First Row -- 6 Timings and Analysis -- References -- Bideterministic Weighted Automata -- 1 Introduction -- 2 Preliminaries -- 3 Bideterministic Weighted Automata over a Semiring -- 4 The Minimality Property of Bideterministic Automata -- 4.1 Fields and Integral Domains -- 4.2 Other Commutative Rings -- 4.3 Positive Semirings -- 5 Decidability of Bideterminisability -- 5.1 Fields -- 5.2 Tropical Semirings -- References -- How to Decide Functionality of Compositions of Top-Down Tree Transducers -- 1 Introduction -- 2 Top-Down Tree Transducers -- 3 Functionality of Two-Fold Compositions -- 3.1 Construction of the LA-Transducer M -- 3.2 Correctness of the LA-Transducer M -- 3.3 Functionality of Arbitrary Compositions -- 4 Conclusion -- References -- Computation of Solutions to Certain Nonlinear Systems of Fuzzy Relation Inequations -- 1 Introduction -- 2 Preliminaries -- 3 Certain Types of Fuzzy Relation Inequations and Their Solutions -- References -- When Variable-Length Codes Meet the Field of Error Detection -- 1 Introduction -- 2 Preliminaries -- 3 Error Detection and the Prefix Metric -- 4 Error Detection and the Factor Metric -- 5 Error Detection in the Topologies Associated to (anti-)automorphisms -- 6 Concluding Remark -- References -- Author Index. |
| Record Nr. | UNINA-9910619279803321 |
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algebraic Informatics [[electronic resource] ] : 3rd International Conference on Algebraic Informatics, CAI 2009, Thessaloniki, Greece, Mai 19-22, 2009 / / edited by Symeon Bozapalidis, George Rahonis
| Algebraic Informatics [[electronic resource] ] : 3rd International Conference on Algebraic Informatics, CAI 2009, Thessaloniki, Greece, Mai 19-22, 2009 / / edited by Symeon Bozapalidis, George Rahonis |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (X, 361 p.) |
| Disciplina | 512 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer programming Machine theory Computer science—Mathematics Software engineering Computer Science Logic and Foundations of Programming Programming Techniques Theory of Computation Formal Languages and Automata Theory Symbolic and Algebraic Manipulation Software Engineering |
| ISBN | 3-642-03564-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Paper of Werner Kuich -- Cycle-Free Finite Automata in Partial Iterative Semirings -- Tutorials -- Picture Languages: From Wang Tiles to 2D Grammars -- Process Algebra: An Algebraic Theory of Concurrency -- Invited Papers -- On Several Proofs of the Recognizability Theorem -- Theories of Automatic Structures and Their Complexity -- The Graph Programming Language GP -- Canonical Reduction Systems in Symbolic Mathematics -- Contributed Papers -- Solving Norm Form Equations over Number Fields -- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages -- Context-Free Categorical Grammars -- An Eilenberg Theorem for Pictures -- On the Complexity of the Syntax of Tree Languages -- On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes -- Computation of Pell Numbers of the Form pX 2 -- Iteration Grove Theories with Applications -- Combinatorics of Finite Words and Suffix Automata -- Polynomial Operators on Classes of Regular Languages -- Self-dual Codes over Small Prime Fields from Combinatorial Designs -- A Backward and a Forward Simulation for Weighted Tree Automata -- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited -- Polynomial Interpolation of the k-th Root of the Discrete Logarithm -- Single-Path Restarting Tree Automata -- Parallel Communicating Grammar Systems with Regular Control. |
| Record Nr. | UNISA-996465733003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algebraic Informatics [[electronic resource] ] : Second International Conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers / / edited by Symeon Bozapalidis, George Rahonis
| Algebraic Informatics [[electronic resource] ] : Second International Conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers / / edited by Symeon Bozapalidis, George Rahonis |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (VIII, 289 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algebra Machine theory Software engineering Computer science—Mathematics Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Software Engineering Symbolic and Algebraic Manipulation |
| ISBN | 3-540-75414-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- On Generalizations of Weighted Finite Automata and Graphics Applications -- Sturmian and Episturmian Words -- From Tree-Based Generators to Delegation Networks -- Bifinite Chu Spaces -- Tiling Recognizable Two-Dimensional Languages -- Algebraic Methods in Quantum Informatics -- Recognizable vs. Regular Picture Languages -- From Algebraic Graph Transformation to Adhesive HLR Categories and Systems -- Contributed Papers -- Deterministic Two-Dimensional Languages over One-Letter Alphabet -- Recognizable Picture Languages and Polyominoes -- An Algebra for Tree-Based Music Generation -- Aperiodicity in Tree Automata -- The Syntactic Complexity of Eulerian Graphs -- Learning Deterministically Recognizable Tree Series — Revisited -- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs -- Verifying Security Protocols for Sensor Networks Using Algebraic Specification Techniques -- Nonassociativity à la Kleene -- Restarting Tree Automata and Linear Context-Free Tree Languages. |
| Record Nr. | UNISA-996465436803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algebraic informatics : second International Conference, CAI 2007, Thessaloniki, Greece, May 21-25, 2007 : revised selected and invited papers / / Symeon Bozapalidis, George Rahonis (eds.)
| Algebraic informatics : second International Conference, CAI 2007, Thessaloniki, Greece, May 21-25, 2007 : revised selected and invited papers / / Symeon Bozapalidis, George Rahonis (eds.) |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2007 |
| Descrizione fisica | 1 online resource (VIII, 289 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
RahonisGeorge
BozapalidesSymeon |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Algebra - Data processing
Computer science |
| ISBN | 3-540-75414-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- On Generalizations of Weighted Finite Automata and Graphics Applications -- Sturmian and Episturmian Words -- From Tree-Based Generators to Delegation Networks -- Bifinite Chu Spaces -- Tiling Recognizable Two-Dimensional Languages -- Algebraic Methods in Quantum Informatics -- Recognizable vs. Regular Picture Languages -- From Algebraic Graph Transformation to Adhesive HLR Categories and Systems -- Contributed Papers -- Deterministic Two-Dimensional Languages over One-Letter Alphabet -- Recognizable Picture Languages and Polyominoes -- An Algebra for Tree-Based Music Generation -- Aperiodicity in Tree Automata -- The Syntactic Complexity of Eulerian Graphs -- Learning Deterministically Recognizable Tree Series — Revisited -- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs -- Verifying Security Protocols for Sensor Networks Using Algebraic Specification Techniques -- Nonassociativity à la Kleene -- Restarting Tree Automata and Linear Context-Free Tree Languages. |
| Altri titoli varianti | CAI 2007 |
| Record Nr. | UNINA-9910768164003321 |
| Berlin, : Springer, 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||