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
AbstractWe prove that a group G has a word problem that is accepted by a deterministic counter autom...
The class of groups generated by automata have been a source of many counterexamples in group theory...
The automata-theoretic approach to the problem of program verification requires efficient minimizati...
AbstractIf one considers abstract deterministic automata as “black boxes”, information about the int...
International audienceThis paper addresses a decision problem highlighted by Grigorchuk, Nekrashevic...
A finite automaton is one of the classic models of recognition devices, which is used to determine t...
A finite automaton is one of the classic models of recognition devices, which is used to determine t...
Recently, the relation of automata and groups has been studied. It was shown that properties of grou...
AbstractNecessary and sufficient conditions for a given automaton to be of left identity type, of id...
Automata act as the recognition devices to determine the types of languages a string belongs to, by ...
Part 1: Invited PapersInternational audienceWe discuss groups and monoids defined by cellular automa...
We examine the evolutionary stability of populations of automata, in the context of the Abreu and Ru...
Work done in the past on the subject of state-identification in finite automata has been limited to ...
Automata act as classical models for recognition devices. From the previous researches, the classica...
ABSTRACT. A class of additive cellular automata (ACA) on a finite group is defined by an index-group...
AbstractWe prove that a group G has a word problem that is accepted by a deterministic counter autom...
The class of groups generated by automata have been a source of many counterexamples in group theory...
The automata-theoretic approach to the problem of program verification requires efficient minimizati...
AbstractIf one considers abstract deterministic automata as “black boxes”, information about the int...
International audienceThis paper addresses a decision problem highlighted by Grigorchuk, Nekrashevic...
A finite automaton is one of the classic models of recognition devices, which is used to determine t...
A finite automaton is one of the classic models of recognition devices, which is used to determine t...
Recently, the relation of automata and groups has been studied. It was shown that properties of grou...
AbstractNecessary and sufficient conditions for a given automaton to be of left identity type, of id...
Automata act as the recognition devices to determine the types of languages a string belongs to, by ...
Part 1: Invited PapersInternational audienceWe discuss groups and monoids defined by cellular automa...
We examine the evolutionary stability of populations of automata, in the context of the Abreu and Ru...
Work done in the past on the subject of state-identification in finite automata has been limited to ...
Automata act as classical models for recognition devices. From the previous researches, the classica...
ABSTRACT. A class of additive cellular automata (ACA) on a finite group is defined by an index-group...
AbstractWe prove that a group G has a word problem that is accepted by a deterministic counter autom...
The class of groups generated by automata have been a source of many counterexamples in group theory...
The automata-theoretic approach to the problem of program verification requires efficient minimizati...