Search results for "abstract"

showing 10 items of 1959 documents

On block pumpable languages

2016

Ehrenfeucht, Parikh and Rozenberg gave an interesting characterisation of the regular languages called the block pumping property. When requiring this property only with respect to members of the language but not with respect to nonmembers, one gets the notion of block pumpable languages. It is shown that these block pumpable are a more general concept than regular languages and that they are an interesting notion of their own: they are closed under intersection, union and homomorphism by transducers; they admit multiple pumping; they have either polynomial or exponential growth.

Discrete mathematicsGeneral Computer ScienceAbstract family of languagesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciences02 engineering and technology01 natural sciencesCone (formal languages)Pumping lemma for regular languagesTheoretical Computer ScienceCombinatoricsRegular languageIntersection010201 computation theory & mathematicsBlock (programming)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingHomomorphismPumping lemma for context-free languagesComputer Science::Formal Languages and Automata TheoryMathematicsTheoretical Computer Science
researchProduct

Algebraic Structures of Rough Sets in Representative Approximation Spaces

2003

Abstract In this paper a generalized notion of an approximation space is considered. By an approximation space we mean an ordered pair (U, C ), where U is a finite nonempty set and C is a covering of U. According to connections between rough sets and concepts we define two types of approximation operations. Hence we obtain two families of rough sets. We show that these families form lattices in special types of representative approximation spaces. The operations on rough sets defined in the above lattices are analogous to classical operations on sets.

Discrete mathematicsGeneral Computer ScienceAlgebraic structureRough setsSpace (mathematics)representative approximation spaceTheoretical Computer ScienceSet (abstract data type)Ordered pairalgebra of rough sets.Rough setapproximation operationsMathematicsComputer Science(all)Electronic Notes in Theoretical Computer Science
researchProduct

The mixed general routing polyhedron

2003

[EN] In Arc Routing Problems, ARPs, the aim is to find on a graph a minimum cost traversal satisfying some conditions related to the links of the graph. Due to restrictions to traverse some streets in a specified way, most applications of ARPs must be modeled with a mixed graph. Although several exact algorithms have been proposed, no polyhedral investigations have been done for ARPs on a mixed graph. In this paper we deal with the Mixed General Routing Problem which consists of finding a minimum cost traversal of a given link subset and a given vertex subset of a mixed graph. A formulation is given that uses only one variable for each link (edge or arc) of the graph. Some properties of the…

Discrete mathematicsGeneral MathematicsArc RoutingMixed graphFacetsPolyhedral combinatoricsRural Postman Problemlaw.inventionGeneral Routing ProblemCombinatoricsTree traversalMixed Chinese Postman ProblemlawroutingGraph traversalGraph (abstract data type)Destination-Sequenced Distance Vector routingMATEMATICA APLICADACircle graphArc routingSoftwareMathematicsofComputing_DISCRETEMATHEMATICSMathematicsPolyhedral graph
researchProduct

L -valued bornologies on powersets

2016

In M. Abel and A. ostak (2011) [1], the concept of an L-fuzzy bornology was introduced. Actually, an L-fuzzy bornology on a set X is a certain ideal in the family LX of L-fuzzy subsets of a set X. Here we propose an alternative approach to fuzzification of the concept of bornology. We define an L-valued bornology on a set X as an L-fuzzy subset B of the powerset 2X satisfying L-valued analogues of the axioms of a bornology. Basic properties of L-valued bornological spaces are studied. Our special interest concerns L-valued bornologies induced by fuzzy metrics and relative compactness-type L-valued bornologies in ChangGoguen L-topological spaces.

Discrete mathematicsIdeal (set theory)Logic010102 general mathematicsFuzzy set02 engineering and technology01 natural sciencesFuzzy logicFuzzy topologyAlgebraSet (abstract data type)Artificial Intelligence0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing0101 mathematicsAxiomMathematicsFuzzy Sets and Systems
researchProduct

JH-Operators and Occasionally Weakly g-Biased Pairs in Fuzzy Symmetric Spaces

2013

We introduce the notions of $\mathcal{JH}$-operators and occasionally weakly $g$-biased mappings in fuzzy symmetric spaces to prove common fixed point theorems for self-mappings satisfying a generalized mixed contractive condition. We also prove analogous results for two pairs of $\mathcal{JH}$-operators by assuming symmetry only on the set of points of coincidence. These results unify, extend and complement many results existing in the recent literature. We give also an application of our results to product spaces.

Discrete mathematicsJH-operatorPure mathematicsFuzzy metric spacelcsh:QA299.6-433lcsh:AnalysisJH-operatorsOccasionally weakly g-biased pairs.Fuzzy logicCoincidenceFuzzy metric spaceSet (abstract data type)Occasionally weakly g-biased pairs"/>Settore MAT/05 - Analisi MatematicaProduct (mathematics)Common fixed pointSymmetry (geometry)Fuzzy symmetric spaceComplement (set theory)MathematicsJournal of Nonlinear Analysis and Application
researchProduct

Quantum Finite Automata and Logics

2006

The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindstrom quantifier is shown.

Discrete mathematicsLindström quantifierNested wordAbstract family of languagesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Computer Science::Computational ComplexityComputer Science::Digital LibrariesAlgebraTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESMonoidal t-norm logicComputer Science::Programming LanguagesQuantum finite automataEquivalence (formal languages)T-norm fuzzy logicsComputer Science::Formal Languages and Automata TheoryAND gateMathematics
researchProduct

On Codimension Growth of Finitely Generated Associative Algebras

1998

Abstract LetAbe a PI-algebra over a fieldF. We study the asymptotic behavior of the sequence of codimensionscn(A) ofA. We show that ifAis finitely generated overFthenInv(A)=limn→∞  c n (A) always exists and is an integer. We also obtain the following characterization of simple algebras:Ais finite dimensional central simple overFif and only ifInv(A)=dim=A.

Discrete mathematicsMathematics(all)SequencePure mathematicsIntegerSimple (abstract algebra)General MathematicsCodimensionFinitely-generated abelian groupCharacterization (mathematics)Associative propertyMathematicsAdvances in Mathematics
researchProduct

On simple families of functions and their Legendrian mappings

2004

We study germs of $n$-parameter families of functions, that is, function-germs of the type $f : (\mathbb{R}^n \times \mathbb{R}, 0) \to (\mathbb{R}, 0)$ defined on the total space of the trivial bundle $ \mathbb{R}^n \times \mathbb{R} \to \mathbb{R}^n $. There is a natural notion of $V$-equivalence for such function-germs. We introduce the Young diagram of $n$-parameter families satisfying a non-degeneracy condition. We classify all such simple $n$-parameter families and give their versal deformations. This result has direct applications to contact and projective geometry.

Discrete mathematicsMathematics::Algebraic GeometryDiagram (category theory)Simple (abstract algebra)General MathematicsType (model theory)Space (mathematics)MathematicsProjective geometryProceedings of the London Mathematical Society
researchProduct

Reconstruction of L-convex Polyominoes.

2003

Abstract We introduce the family of L-convex polyominoes, a subset of convex polyominoes whose elements satisfy a special convexity property. We develop an algorithm that reconstructs an L-convex polyomino from the set of its maximal L-polyominoes.

Discrete mathematicsMathematics::CombinatoricsProperty (philosophy)PolyominoApplied MathematicsRegular polygonPolyominoesComputer Science::Computational GeometryConvexityCombinatoricsSet (abstract data type)Computer Science::Discrete MathematicsDiscrete Mathematics and CombinatoricsComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

A short proof of a theorem of Juhasz

2011

Abstract We give a simple proof of the increasing strengthening of Arhangelʼskii Theorem. Our proof naturally leads to a refinement of this result of Juhasz.

Discrete mathematicsMathematics::General TopologyFree sequenceAlgebraMathematics::LogicIncreasing unionSimple (abstract algebra)Settore MAT/03 - GeometriaElementary submodelGeometry and TopologyArhangel'skii TheoremMathematics::Symplectic GeometryArhangelʼskii TheoremMathematicsAnalytic proof
researchProduct