Journal: Discrete Applied Mathematics

Found 533 papers in total
Cellular automata, ωωà-regular sets, and sofic systems
Cellular automata, ωωà-regular sets, and sofic systems
1991,
The authors study and compare several mechanisms for defining sets of biinfinite words...
Grammatical codes of trees
Grammatical codes of trees
1991,
The problem of coding (chain free) trees by words where the length of the word coding...
Decidability problems for unary output sequential transducers
Decidability problems for unary output sequential transducers
1991,
Ibarra has proved that the equivalence problem for unary output sequential transducers...
On generalized zeta functions of formal languages and series
On generalized zeta functions of formal languages and series
1991,
Generalized zeta functions of formal languages and series are studied and given...
On the power of synchronization in parallel computations
On the power of synchronization in parallel computations
1991,
This paper continues investigations of synchronized alternating machines which provide...
Power languages and density
Power languages and density
1991,
The class of all languages can be seen as a distributive lattice with respect to a...
Defining families of trees with E0L grammars
Defining families of trees with E0L grammars
1991,
The authors consider E0L grammars as tree-generating mechanisms. This leads to...
Trace monoids with some invertible generators: Two decision problems
Trace monoids with some invertible generators: Two decision problems
1991,
Linear-time algorithms are given for the Word and Conjugacy Problems for trace monoids...
Weavings, section and projections of spherical polyhedra
Weavings, section and projections of spherical polyhedra
1991,
The paper gives simultaneous answers to three questions: (a) When does a plane picture...
Transformation completeness properties of SVPC transformation sets
Transformation completeness properties of SVPC transformation sets
1991,
A set T of permutations of a finite set is said to be transformation complete if the...
Tighter bound for MULTIFIT scheduling on uniform processors
Tighter bound for MULTIFIT scheduling on uniform processors
1991,
The paper examines one of the basic, well studied problems of scheduling theory, that...
Splicing semigroups of dominoes and DNA
Splicing semigroups of dominoes and DNA
1991,
The authors introduce semigroups of dominoes as a tool for working with sets of linked...
Intersection of algebraic space curves
Intersection of algebraic space curves
1991,
Bezout’s theorem gives the degree of intersection of two properly intersecting...
Convex hulls of samples from spherically symmetric distributions
Convex hulls of samples from spherically symmetric distributions
1991,
The convex hull of a set of independent random points sampled from three types of...
Bounding the number of k-faces in arrangement of hyperplanes
Bounding the number of k-faces in arrangement of hyperplanes
1991,
The authors study certain structural problems of arrangements of hyperplanes in d...
Combinatorial face enumeration in arrangements and oriented matroids
Combinatorial face enumeration in arrangements and oriented matroids
1991,
Let denote the number of k- dimensional faces of a d -dimensional arrangement of...
The complexity of point configurations
The complexity of point configurations
1991,
There are several natural ways to extend the notion of the order of points on a line...
Higher dimensional restricted lattice paths with diagonal steps
Higher dimensional restricted lattice paths with diagonal steps
1991,
In this paper, restricted minimal lattice paths with horizontal, vertical, and...
Synthetic description of a semiorder
Synthetic description of a semiorder
1991,
Recently, in studying minimal representations of semiorders, a substructure of...
Computing external farthest neighbors for a simple polygon
Computing external farthest neighbors for a simple polygon
1991,
Let 𝒫 be (the boundary of) a simple polygon with n vertices. For a vertex p of...
Ordered stabbing of pairwise disjoint convex sets in linear time
Ordered stabbing of pairwise disjoint convex sets in linear time
1991,
Given an ordered family of n pairwise disjoint convex simple objects in the plane, the...
Constructing the relative neighborhood graph in 3-dimensional Euclidean space
Constructing the relative neighborhood graph in 3-dimensional Euclidean space
1991,
The relative neighborhood graph for a finite set of points, briefly RNG( S), is...
An efficient algorithm for finding a two-pair, and its applications
An efficient algorithm for finding a two-pair, and its applications
1991,
One of the fundamental notions in computer geometry is the concept of visibility. A...
Distances in a rigid unit-distance graph in the plane
Distances in a rigid unit-distance graph in the plane
1991,
It is proved that a number d>0 can appear as the Euclidean distance between two...
Papers per page: