AbstractIf one considers abstract deterministic automata as “black boxes”, information about the interior of the black box is available by identifier experiments (of first- or second-order). Effects by wrong automaton operation disappear under certain stability properties of the automaton (see [7]). In this note we give a bound for stability and study under which conditions identifier experiments exist if the state set of the automaton is a (not necessarily abelian) group with multiple operators
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
AbstractWe prove that a group G has a word problem that is accepted by a deterministic counter autom...
This dissertation is devoted to various aspects of groups generated by automata. We study particular...
AbstractIf one considers abstract deterministic automata as “black boxes”, information about the int...
A series-parallel decomposition of an automaton A into r components (r ⩾ 1) is said to be practical ...
A remark is proved concerning certain groups associated with any finite automaton which satisfies a ...
AbstractRelationships between the group, Aut(M), of automorphisms of a linear automaton M and the st...
Content in the UH Research Archive is made available for personal research, educational, and non-com...
This paper is a summary of my seminars given in the Research Group on Mathematical Linguistics in th...
AbstractLet D be a class of digraphs. Supposing that the strongly connected subgraphs of digraphs in...
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related t...
AbstractThe class of all state-independent automata is characterized as a subclass of all semigroup ...
The class of groups generated by automata have been a source of many counterexamples in group theory...
We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural re...
Every cyclic automaton is isomorphic to a semi-group quotient automaton, while for a homogeneous aut...
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
AbstractWe prove that a group G has a word problem that is accepted by a deterministic counter autom...
This dissertation is devoted to various aspects of groups generated by automata. We study particular...
AbstractIf one considers abstract deterministic automata as “black boxes”, information about the int...
A series-parallel decomposition of an automaton A into r components (r ⩾ 1) is said to be practical ...
A remark is proved concerning certain groups associated with any finite automaton which satisfies a ...
AbstractRelationships between the group, Aut(M), of automorphisms of a linear automaton M and the st...
Content in the UH Research Archive is made available for personal research, educational, and non-com...
This paper is a summary of my seminars given in the Research Group on Mathematical Linguistics in th...
AbstractLet D be a class of digraphs. Supposing that the strongly connected subgraphs of digraphs in...
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related t...
AbstractThe class of all state-independent automata is characterized as a subclass of all semigroup ...
The class of groups generated by automata have been a source of many counterexamples in group theory...
We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural re...
Every cyclic automaton is isomorphic to a semi-group quotient automaton, while for a homogeneous aut...
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
AbstractWe prove that a group G has a word problem that is accepted by a deterministic counter autom...
This dissertation is devoted to various aspects of groups generated by automata. We study particular...