Recognizable filters and ideals
Page 1
Displaying 1 – 5 of 5
Reconstructibility of Boolean control networks with time delays in states
Ping Sun, Lijun Zhang, Kuize Zhang (2018)
Kybernetika
This paper deals with the reconstructibility of Boolean control networks (BCNs) with time delays in states. First, a survey on the semi-tensor product, weighted pair graph, constructed forest and finite automata is given. Second, by using the weighted pair graph, constructed forest and finite automata, an algorithm is designed to judge whether a Boolean control network with time delays in states is reconstructable or not under a mild assumption. Third, an algorithm is proposed to determine the current...
Relating automata-theoretic hierarchies to complexity-theoretic hierarchies
Victor L. Selivanov (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynomial-time hierarchy. This extends a result of Burtschik and Vollmer on relationship between the Straubing and the polynomial hierarchies. In particular, this applies to the Boolean hierarchy and the plus-hierarchy.
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
Victor L. Selivanov (2010)
RAIRO - Theoretical Informatics and Applications
We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynomial-time hierarchy. This extends a result of Burtschik and Vollmer on relationship between the Straubing and the polynomial hierarchies. In particular, this applies to the Boolean hierarchy and the plus-hierarchy.
Relational monoids, multirelations, and quantalic recognizers
Kimmo L. Rosenthal (1997)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Currently displaying 1 – 5 of 5
Page 1