Holonomic functions and their relation to linearly constrained languages
Holonomy orbits of the snake charmer algorithm
Homogeneity properties of hypercubes.
Homogeneous aggregation operators
Recently, the utilization of invariant aggregation operators, i.e., aggregation operators not depending on a given scale of measurement was found as a very current theme. One type of invariantness of aggregation operators is the homogeneity what means that an aggregation operator is invariant with respect to multiplication by a constant. We present here a complete characterization of homogeneous aggregation operators. We discuss a relationship between homogeneity, kernel property and shift-invariance...
Homological properties of non-deterministic branchings of mergings in higher dimensional automata.
Homology of representable sets
We generalize the notion of cubical homology to the class of locally compact representable sets in order to propose a new convenient method of reducing the complexity of a set while computing its homology.
Homomorphic correspondences of relational systems
Homomorphisms of machines. I
Homomorphisms of machines. II
Homotopical interpretation of globular complex by multipointed d-space.
Hopcroft's algorithm and tree-like automata
Minimizing a deterministic finite automata (DFA) is a very important problem in theory of automata and formal languages. Hopcroft's algorithm represents the fastest known solution to the such a problem. In this paper we analyze the behavior of this algorithm on a family binary automata, called tree-like automata, associated to binary labeled trees constructed by words. We prove that all the executions of the algorithm on tree-like automata associated to trees, constructed by standard words, have...
Hopcroft's algorithm and tree-like automata
Minimizing a deterministic finite automata (DFA) is a very important problem in theory of automata and formal languages. Hopcroft's algorithm represents the fastest known solution to the such a problem. In this paper we analyze the behavior of this algorithm on a family binary automata, called tree-like automata, associated to binary labeled trees constructed by words. We prove that all the executions of the algorithm on tree-like automata associated to trees, constructed by standard words, have...
Horn clause programs and recursive functions defined by systems of equations
Hotz-isomorphism theorems in formal language theory
How expressions can code for automata
In this paper we investigate how it is possible to recover an automaton from a rational expression that has been computed from that automaton. The notion of derived term of an expression, introduced by Antimirov, appears to be instrumental in this problem. The second important ingredient is the co-minimization of an automaton, a dual and generalized Moore algorithm on non-deterministic automata. We show here that if an automaton is then sufficiently “decorated”, the combination of these two algorithms...
How expressions can code for automata
In this paper we investigate how it is possible to recover an automaton from a rational expression that has been computed from that automaton. The notion of derived term of an expression, introduced by Antimirov, appears to be instrumental in this problem. The second important ingredient is the co-minimization of an automaton, a dual and generalized Moore algorithm on non-deterministic automata. We show here that if an automaton is then sufficiently “decorated”, the combination of...
How Hard Is Half-Space Range Searching?
How hyperpolarization and the recovery of excitability affect propagation through a virtual anode in the heart.
How many square occurrences must a binary sequence contain?
How much semigroup structure is needed to encode graphs ?