Sciweavers

5019 search results - page 11 / 1004
» Computing in Quotient Groups
Sort
View
FPLE
1995
15 years 3 months ago
Explaining Algebraic Theory with Functional Programs
Abstract. A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance d...
Jeroen Fokker
ADBIS
2009
Springer
108views Database» more  ADBIS 2009»
15 years 6 months ago
Linear Systems for Regular Hedge Languages
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the a...
Mircea Marin, Temur Kutsia
JCT
2006
100views more  JCT 2006»
14 years 11 months ago
Enumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
Alexander Mednykh, Roman Nedela
MFCS
2004
Springer
15 years 5 months ago
Decidability of Trajectory-Based Equations
We consider the decidability of existence of solutions to language equations involving the operations of shuffle and deletion along trajectories. These operations generalize the o...
Michael Domaratzki, Kai Salomaa