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.

Biblioteca

MARC Lista (tabellare)
ACM communications in computer algebra
ACM communications in computer algebra
Pubbl/distr/stampa New York, : Association for Computing Machinery
Disciplina 005
Soggetto topico Algebra - Data processing
Mathematics
Soggetto genere / forma Periodicals.
Soggetto non controllato Algebra
ISSN 1932-2240
Formato Materiale a stampa
Livello bibliografico Periodico
Lingua di pubblicazione eng
Altri titoli varianti Association for Computing Machinery communications in computer algebra
Communications in computer algebra
SIGSAM communications in computer algebra
Record Nr. UNISA-996218820603316
New York, : Association for Computing Machinery
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
ACM communications in computer algebra
ACM communications in computer algebra
Pubbl/distr/stampa New York, : Association for Computing Machinery
Descrizione fisica 1 online resource
Disciplina 005
Soggetto topico Algebra - Data processing
Mathematics
Algèbre - Informatique
Soggetto genere / forma Periodicals.
ISSN 1932-2240
Formato Materiale a stampa
Livello bibliografico Periodico
Lingua di pubblicazione eng
Altri titoli varianti Association for Computing Machinery communications in computer algebra
Communications in computer algebra
SIGSAM communications in computer algebra
Record Nr. UNINA-9910376056403321
New York, : Association for Computing Machinery
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
ACM SIGSAM bulletin
ACM SIGSAM bulletin
Pubbl/distr/stampa [New York?], : ACM SIGSAM
Disciplina 512.02
Soggetto topico Algebra - Data processing
Algèbre - Informatique
Algèbre
Calcul formel
Informatique
Soggetto genere / forma Periodicals.
Ressource Internet (Descripteur de forme)
Périodique électronique (Descripteur de forme)
ISSN 1557-9492
Formato Materiale a stampa
Livello bibliografico Periodico
Lingua di pubblicazione eng
Record Nr. UNINA-9910375865803321
[New York?], : ACM SIGSAM
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advances in combinatorial mathematics [e-book] : Proceedings of the Waterloo Workshop in Computer Algebra 2008 / edited by Ilias S. Kotsireas, Eugene V. Zima
Advances in combinatorial mathematics [e-book] : Proceedings of the Waterloo Workshop in Computer Algebra 2008 / edited by Ilias S. Kotsireas, Eugene V. Zima
Pubbl/distr/stampa Berlin : Springer, 2009
Descrizione fisica v.: digital
Altri autori (Persone) Kotsireas, Ilias S.
Zima, Eugene V.
Soggetto topico Mathematics
Algebra - Data processing
Algebra
Combinatorics
ISBN 9783642035623
Formato Software
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991001284059707536
Berlin : Springer, 2009
Software
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Advances in combinatorics : Waterloo Workshop in Computer Algebra 2011, (WWCA 2011, W80), May 26-29, 2011 : in memory of Herbert S. Wilf / / Ilias S. Kotsireas, Eugene V. Zima, editors
Advances in combinatorics : Waterloo Workshop in Computer Algebra 2011, (WWCA 2011, W80), May 26-29, 2011 : in memory of Herbert S. Wilf / / Ilias S. Kotsireas, Eugene V. Zima, editors
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin ; ; New York, : Springer, 2013
Descrizione fisica 1 online resource (xx, 293 pages) : illustrations (some color)
Disciplina 511.6
Altri autori (Persone) WilfHerbert S. <1931-2012.>
KotsireasIlias S
ZimaE. V (Evgenii Viktorovich)
Collana Gale eBooks
Soggetto topico Algebra - Data processing
Computer algorithms
Combinatorial analysis
ISBN 9783642309793
3642309798
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Foreword by Andrew M. Odlyzko -- Glaisher’s formulas for 1/p2 and some generalizations: Gert Almkvist -- Complementary Bell numbers: Arithmetical properties and Wilf’s conjecture: Tewodros Amdeberhan and Valerio De Angelis and Victor H. Moll.- Partitions With Early Conditions: George E. Andrews -- Hypergeometric identities associated with statistics on words: George E. Andrews, Carla D. Savage, and Herbert S. Wilf -- Stationary Distribution and Eigenvalues for a de Bruijn Process: Arvind Ayyer and Volker Strehl -- Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf Classes: Andrew Baxter, Brian Nakamura, and Doron Zeilberger -- Watson–Like Formulae for Terminating 3F2-Series: Wenchang Chu and Roberta R. Zhou -- Balls in Boxes: Variations on a Theme of Warren Ewens and Herbert Wilf: Shalosh B. Ekhad and Doron Zeilberger -- Beating Your Fractional Beatty Game Opponent and: What’s the Question to Your Answer? Aviezri S. Fraenkel -- WZ-proofs of “divergent” Ramanujan-type series: Jesús Guillera -- Smallest parts in compositions: Arnold Knopfmacher and Augustine O. Munagi -- Cyclic Sieving for Generalised Non-Crossing Partitions Associated with Complex Reflection Groups of Exceptional Type: Christian Krattenthaler and ThomasW. M¨ uller -- Set partitions with no m-nesting: Marni Mishna and Lily Yen -- The distribution of zeros of the derivative of a random polynomial: Robin Pemantle and Igor Rivin -- On the distribution of small denominators in the Farey series of order N: C.L. Stewart -- Lost in translation: Wadim Zudilin.
Altri titoli varianti WWCA 2011
Record Nr. UNINA-9910438150703321
Berlin ; ; New York, : Springer, 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algebra and coalgebra in computer science : third international conference, CALCO 2009, Udine, Italy, September 7-10, 2009, proceedings / / Alexander Kurz, Marina Lenisa, Andrzej Tarlecki (eds.)
Algebra and coalgebra in computer science : third international conference, CALCO 2009, Udine, Italy, September 7-10, 2009, proceedings / / Alexander Kurz, Marina Lenisa, Andrzej Tarlecki (eds.)
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin ; ; Heidelberg, : Springer-Verlag, 2009
Descrizione fisica 1 online resource (XI, 457 p.)
Disciplina 004.0151
Altri autori (Persone) KurzAlexander
LenisaMarina
TarleckiAndrzej
Collana Lecture notes in computer science
Soggetto topico Algebra - Data processing
Computational complexity
Computer science
Logic design
ISBN 3-642-03741-0
Classificazione DAT 500f
DAT 702f
MAT 110f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algebraic Effects and Recursive Equations -- Adequacy for Infinitary Algebraic Effects (Abstract) -- Algebras for Parameterised Monads -- Kleene Monads: Handling Iteration in a Framework of Generic Effects -- Complete Iterativity for Algebras with Effects -- Semantics of Higher-Order Recursion Schemes -- Theory of Coalgebra -- Coalgebraic Components in a Many-Sorted Microcosm -- Complementation of Coalgebra Automata -- Characterising Behavioural Equivalence: Three Sides of One Coin -- Coinduction -- Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract) -- Circular Coinduction: A Proof Theoretical Foundation -- Bisimulation -- Approximating Labelled Markov Processes Again! -- Weak Bisimilarity Coalgebraically -- Coalgebraic Symbolic Semantics -- Relating Coalgebraic Notions of Bisimulation -- Traces, Executions and Schedulers, Coalgebraically -- Non-strongly Stable Orders Also Define Interesting Simulation Relations -- Stone Duality -- Stone Duality and the Recognisable Languages over an Algebra -- Free Heyting Algebras: Revisited -- Distributive Lattice-Structured Ontologies -- A Duality Theorem for Real C * Algebras -- Game Theory -- Conway Games, Coalgebraically -- A Semantical Approach to Equilibria and Rationality -- Graph Transformation -- Van Kampen Colimits as Bicolimits in Span -- Unfolding Grammars in Adhesive Categories -- Software Development Techniques -- Views on Behaviour Protocols and Their Semantic Foundation -- Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation -- Constructor-Based Institutions -- CALCO Tools Workshop -- DBtk: A Toolkit for Directed Bigraphs -- Constraint-Muse: A Soft-Constraint Based System for Music Therapy -- CIRC: A Behavioral Verification Tool Based on Circular Coinduction -- The Priced-Timed Maude Tool -- A Tool Proving Well-Definedness of Streams Using Termination Tools.
Record Nr. UNINA-9910484370903321
Berlin ; ; Heidelberg, : Springer-Verlag, 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algebra, meaning, and computation : essays dedicated to Joseph A. Goguen on the occasion of his 65th birthday / / Kokichi Futatsugi, Jean-Pierre Jouannaud, Jose Meseguer (eds.)
Algebra, meaning, and computation : essays dedicated to Joseph A. Goguen on the occasion of his 65th birthday / / Kokichi Futatsugi, Jean-Pierre Jouannaud, Jose Meseguer (eds.)
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin ; ; New York, : Springer-Verlag, c2006
Descrizione fisica 1 online resource (XXXVIII, 650 p.)
Disciplina 512
Altri autori (Persone) GoguenJoseph
FutatsugiKokichi
JouannaudJean-Pierre
MeseguerJose
Collana Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Soggetto topico Algebra
Algebra - Data processing
ISBN 3-540-35464-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Meaning -- Sync or Swarm: Musical Improvisation and the Complex Dynamics of Group Creativity -- My Friend Joseph Goguen -- Metalogic, Qualia, and Identity on Neptune’s Great Moon: Meaning and Mathematics in the Works of Joseph A. Goguen and Samuel R. Delany -- Meta-Logic -- Quantum Institutions -- Jewels of Institution-Independent Model Theory -- Semantic Web Languages – Towards an Institutional Perspective -- Institutional 2-cells and Grothendieck Institutions -- Some Varieties of Equational Logic -- Complete Categorical Deduction for Satisfaction as Injectivity -- Specification and Composition -- Extension Morphisms for CommUnity -- Non-intrusive Formal Methods and Strategic Rewriting for a Chemical Application -- From OBJ to ML to Coq -- Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations -- From OBJ to Maude and Beyond -- Constructive Action Semantics in OBJ -- Horizontal Composability Revisited -- Composition by Colimit and Formal Software Development -- Behaviour and Formal Languages -- Proving Behavioral Refinements of COL-specifications -- The Reactive Engine for Modular Transducers -- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages -- Sheaves and Structures of Transition Systems -- Uniform Functors on Sets -- An Algebraic Approach to Regular Sets -- Models, Deduction, and Computation -- Elementary Algebraic Specifications of the Rational Complex Numbers -- From Chaos to Undefinedness -- Completion Is an Instance of Abstract Canonical System Inference -- Eliminating Dependent Pattern Matching -- Iterative Lexicographic Path Orders -- A Functorial Framework for Constraint Normal Logic Programming -- A Stochastic Theory of Black-Box Software Testing -- Some Tips on Writing Proof Scores in the OTS/CafeOBJ Method -- Drug Interaction Ontology (DIO) and the Resource-Sensitive Logical Inferences.
Record Nr. UNINA-9910484787503321
Berlin ; ; New York, : Springer-Verlag, c2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
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
Opac: Controlla la disponibilità qui
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
Opac: Controlla la disponibilità qui
Algebraic informatics : third international conference ; proceedings, CAI 2009, Thessaloniki, Greece, May 19 - 22, 2009 / / Symeon Bozapalidis, George Rahonis (eds.)
Algebraic informatics : third international conference ; proceedings, CAI 2009, Thessaloniki, Greece, May 19 - 22, 2009 / / Symeon Bozapalidis, George Rahonis (eds.)
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin ; ; Heidelberg ; ; New York, : Springer, c2009
Descrizione fisica 1 online resource (X, 361 p.)
Disciplina 512
Altri autori (Persone) BozapalidesSymeon
RachonesGeorgios <1965->
Collana Lecture notes in computer science
Soggetto topico Algebra - Data processing
Formal methods (Computer science)
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.
Altri titoli varianti CAI 2009
Record Nr. UNINA-9910484980503321
Berlin ; ; Heidelberg ; ; New York, : Springer, c2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui