We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. The approximation is implemented by limiting the maximum nesting depth of links, and otherwise retains the features of the original formalism. We present a string encoding of Link Grammar parses and describe finite-stat...

Over trees and partial orders, chain logic and path logic are systems of monadic second-order logic in which second-order quantification is applied to paths and to chains (i.e., subsets of paths), respectively; accordingly we speak of the path theory and the chain theory of a structure. We present some known and some new results on decidability of the path theory and chain theory of structures ...

We study the state complexity of regular tree languages for tree matching problem. Given a tree t and a set of pattern trees L, we can decide whether or not there exists a subtree occurrence of trees in L from the tree t by considering the new language L′ which accepts all trees containing trees in L as subtrees. We consider the case when we are given a set of pattern trees as a regular tree la...

A group is boundedly simple if for some constant N , every nontrivial conjugacy class generates the whole group in N steps (bounded simplicity implies simplicity). For a large class of trees, Tits proved simplicity of automorphism groups generated by stabilisers of edges. We determine the subclass of trees for which such groups are boundedly simple. This is the class of subdivisions of bi-regul...

In practical telephone dialogue applications there are many problems with a speech detection. This paper discusses two main problems with a silence detection and presents techniques for increasing reliability and recognition accuracy of the whole telephone dialogue system. The first problem causes a different level of signal and background noise of incoming calls. The solution could be to store...

Regular Tree Model Checking with Nondeterministic Automata

We analyze the astronomical data on the explosions of supernovae Ia as well as the precision measurement of cosmic microwave background in order to get a model-independent determination of the acceleration parameter for the Universe evolution. The effective parameter of state in the cosmological equations, which gives the ratio of pressure to the energy density, as shown, can naturally get the ...

In this paper, I determine the electrogravitational field produced by a charged mass point according to the Relativistic Theory of Gravitation. The Causality Principle in the Relativistic Theory of Gravitation will play a very important part in finding this field. The analytical form and the domain of definition, i.e the gravitational radius of the obtained solution, differ from that given by E...

For every hierarchical system of equations S over some complete and distributive lattice we construct an equivalent system with the same set of variables which additionally is guarded. The price to be paid is that the resulting right-hand sides may grow exponentially. We therefore present methods how the exponential blow-up can be avoided. Especially, the loop structure of the variable dependen...

The Goldschmidt-Sims conjecture asserts that there is a nite number of (conjugacy classes of) edge transitive lattices in the automorphism group of a regular tree with prime valence. We prove a similar theorem for irreducible lattices, transitive on the 2-cells of the product of two regular trees of prime valences.