Results 281 to 290 of about 948,220 (309)
Some of the next articles are maybe not open access.
State Complexity of Regular Languages
J. Autom. Lang. Comb., 2001State complexity is a descriptional complexity measure for regular languages based on the deterministic finite automaton model. We investigate and review the problems related to the state complexity of regular languages, as well as finite languages, and their operations.
openaire +2 more sources
The Complexity of Boolean State Separation
2020For a Boolean type of nets \(\tau \), a transition system A is synthesizeable into a \(\tau \)-net N if and only if distinct states of A correspond to distinct markings of N, and N prevents a transition firing if there is no related transition in A.
Ronny Tredup, Evgeny Erofeev
openaire +1 more source
State Complexity of Proportional Removals
J. Autom. Lang. Comb., 2002Journal of Automata, Languages and Combinatorics, Volume 7, Number 4, 2002, 455 ...
openaire +2 more sources
State Complexity Research and Approximation
2011A number of basic questions concerning the state complexity research are discussed, which include why many basic problems weren't studied earlier, whether there is a general algorithm for state complexity, and whether there is a new approach in this area of research. The new concept of state complexity approximation is also discussed. We show that this
Sheng Yu 0001, Yuan Gao 0001
openaire +1 more source
Polycomb complexes and epigenetic states
Current Opinion in Cell Biology, 2008Important advances in the study of Polycomb Group (PcG) complexes in the past two years have focused on the role of this repressive system in programing the genome. Genome-wide analyses have shown that PcG mechanisms control a large number of genes regulating many cellular functions and all developmental pathways.
Yuri B, Schwartz, Vincenzo, Pirrotta
openaire +2 more sources
On the State Complexities of Ternary Codes
1999The paper studies self-orthogonal codes over GF(3). The state complexities ofs uch codes of lengths ≤ 20 with efficient coordinate ordering are found.
Sylvia B. Encheva, Gérard D. Cohen
openaire +1 more source
Dissociative states and neural complexity
Brain and Cognition, 2011Recent findings indicate that neural mechanisms of consciousness are related to integration of distributed neural assemblies. This neural integration is particularly vulnerable to past stressful experiences that can lead to disintegration and dissociation of consciousness. These findings suggest that dissociation could be described as a level of neural
Petr, Bob, Miroslav, Svetlak
openaire +2 more sources
The State Complexity of Alternating Automata
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018This paper studies the complexity of languages of finite words using automata theory. To go beyond the class of regular languages, we consider infinite automata and the notion of state complexity defined by Karp. We look at alternating automata as introduced by Chandra, Kozen and Stockmeyer: such machines run independent computations on the word and ...
openaire +1 more source
Density of states for complex molecules
Physical Review A, 1994A framework is presented to compute absolute thermodynamic properties of complex molecules which are described algebraically. Using some basic properties of the algebraic formalism, it is pointed out that one can compute not only ensemble averages, but the absolute thermal quantities such as the density of states and partition function.
openaire +2 more sources
State Complexity and Limited Nondeterminism
2012We consider nondeterministic finite automata having finite tree width (ftw-NFA) where the computation on any input string has a constant number of branches. We give effective characterizations of ftw-NFAs and a tight worst-case state size bound for determinizing an ftw-NFA A as a function of the tree width and the number of states of A.
Alexandros Palioudakis +2 more
openaire +1 more source