AbstractThe complexity of array automata which compute Beyer's topological matching predicate is studied. This predicate on two n × n figures is true if and only if the trees describing their topological structure are isomorphic. An algorithm is proposed which is proved to operate in order of n2 steps on pairs of n × n figures, a significant improvement over Beyer's order of n4 algorithm
Finite state automata are Turing machines with fixed finite bounds on resource use. Automata lend t...
AbstractGraph automata have been introduced by Rosensthiel (1966). He has shown how a graph automato...
AbstractThe subsequence matching problem is to decide, for given strings S and T, whether S is a sub...
AbstractThe complexity of array automata which compute Beyer's topological matching predicate is stu...
A study is made of the recognition and transformation of figures by iterative arrays of finite sta...
In this paper we study recognition of topological invariant properties of patterns by use of finite,...
The article surveys recent results in the study of topological complexity of recognizable tree langu...
In this paper we provide an implementable formal algorithm for knowledge bases equivalence verificat...
This work shows that for each i ∈ ω there exists a Σ1i-hard ω-word language definable in Monadic Sec...
AbstractWe solve the isomorphism problem for certain classes of unary automatic structures: unary au...
Abstract. We investigate the topological complexity of non Borel recognizable tree languages with re...
Abstract. We present our unied view to pattern matching problems and their solutions. We classify pa...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...
We consider the query and computational complexity of learning multiplicity tree automata in Angluin...
1 Topological and Geometrical Combinatorics Martin Tancer Abstract The task of the thesis is to pres...
Finite state automata are Turing machines with fixed finite bounds on resource use. Automata lend t...
AbstractGraph automata have been introduced by Rosensthiel (1966). He has shown how a graph automato...
AbstractThe subsequence matching problem is to decide, for given strings S and T, whether S is a sub...
AbstractThe complexity of array automata which compute Beyer's topological matching predicate is stu...
A study is made of the recognition and transformation of figures by iterative arrays of finite sta...
In this paper we study recognition of topological invariant properties of patterns by use of finite,...
The article surveys recent results in the study of topological complexity of recognizable tree langu...
In this paper we provide an implementable formal algorithm for knowledge bases equivalence verificat...
This work shows that for each i ∈ ω there exists a Σ1i-hard ω-word language definable in Monadic Sec...
AbstractWe solve the isomorphism problem for certain classes of unary automatic structures: unary au...
Abstract. We investigate the topological complexity of non Borel recognizable tree languages with re...
Abstract. We present our unied view to pattern matching problems and their solutions. We classify pa...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...
We consider the query and computational complexity of learning multiplicity tree automata in Angluin...
1 Topological and Geometrical Combinatorics Martin Tancer Abstract The task of the thesis is to pres...
Finite state automata are Turing machines with fixed finite bounds on resource use. Automata lend t...
AbstractGraph automata have been introduced by Rosensthiel (1966). He has shown how a graph automato...
AbstractThe subsequence matching problem is to decide, for given strings S and T, whether S is a sub...
DOI
Add to ORKG