• Produktbild: Universal Algebra and Applications in Theoretical Computer Science
  • Produktbild: Universal Algebra and Applications in Theoretical Computer Science

Universal Algebra and Applications in Theoretical Computer Science

196,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

18.01.2002

Abbildungen

schwarz-weiss Illustrationen

Verlag

Taylor and Francis

Seitenzahl

396

Maße (L/B/H)

24/16,1/2,6 cm

Gewicht

760 g

Sprache

Englisch

ISBN

978-1-58488-254-1

Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

18.01.2002

Abbildungen

schwarz-weiss Illustrationen

Verlag

Taylor and Francis

Seitenzahl

396

Maße (L/B/H)

24/16,1/2,6 cm

Gewicht

760 g

Sprache

Englisch

ISBN

978-1-58488-254-1

Herstelleradresse

Libri GmbH
Europaallee 1
36244 Bad Hersfeld
DE

Email: gpsr@libri.de

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Universal Algebra and Applications in Theoretical Computer Science
  • Produktbild: Universal Algebra and Applications in Theoretical Computer Science
  • BASIC CONCEPTSAlgebrasExamplesSubalgebrasCongruence Relations and QuotientsExercisesGALOIS CONNECTIONS AND CLOSURESClosure OperatorsGalois ConnectionsConcept AnalysisExercisesHOMOMORPHISMS AND ISOMORPHISMSThe Homomorphism TheoremThe Isomorphism TheoremsExercisesDIRECT AND SUBDIRECT PRODUCTSDirect ProductsSubdirect ProductsExercisesTERMS, TREES, AND POLYNOMIALSTerms and TreesTerm OperationsPolynomials and Polynomial OperationsExercisesIDENTITIES AND VARIETIESThe Galois-Connection (Id, Mod)Fully Invariant Congruence RelationsThe Algebraic Consequence RelationRelatively Free AlgebrasVarietiesThe Lattice of All VarietiesFinite AxiomatizabilityExercisesTERM REWRITING SYSTEMSConfluenceReduction SystemsTerm RewritingTermination of Term Rewriting SystemsExercisesALGEBRAIC MACHINESRegular LanguagesFinite AutomataAlgebraic Operations on Finite AutomataTree-RecognizersRegular Tree GrammarsOperations on Tree LanguagesMinimal Tree-RecognizersTree TransducersTuring MachinesUndecidable ProblemsExercisesMAL'CEV-TYPE CONDITIONSCongruence PermutabilityCongruence DistributivityArithmetical Varietiesn-Modularity and n-PermutabilityCongruence Regular VarietiesTwo-Element AlgebrasExercisesCLONES AND COMPLETENESSClones as Algebraic StructuresOperations and RelationsThe Lattice of all Boolean ClonesThe Functional Completeness ProblemPrimal AlgebrasDifferent Generalizations of PrimalityPreprimal AlgebrasTAME CONGRUENCE THEORYMinimal AlgebrasTame Congruence RelationsPermutation AlgebrasThe Types of Minimal AlgebrasMal'cev Conditions and Omitting TypesResidually Small VarietiesTERM CONDITION AND COMMUTATORThe Term ConditionThe CommutatorCOMPLETE SUBLATTICESConjugate Pairs of Closure OperatorsGalois-Closed SubrelationsClosure Operators on Complete LatticesG-CLONES AND M-SOLID VARIETIESG-ClonesH-ClonesM-Solid VarietiesIntervals in the Lattice L(t)HYPERSUBSTITUTIONS AND MACHINESThe Hyperunification ProblemHyper-Tree-RecognizersTree TransformationsBIBLIOGRAPHYINDEX