Results 11 to 20 of about 948,220 (309)
State complexity of cyclic shift [PDF]
RAIRO - Theoretical Informatics and Applications, 2007 Summary: The cyclic shift of a language \(L\), defined as \(\text{SHIFT}(L) = \{vu \mid uv \in L\}\), is an operation known to preserve both regularity and context-freeness. Its descriptional complexity has been addressed in Maslov's pioneering paper on the state complexity of regular language operations [\textit{A. N. Maslov}, Sov. Math., Dokl.
Galina Jirásková, Alexander Okhotin
openaire +3 more sources
Governing Complexity in World Politics
, 2021 Complexity is the new global ontology for world politics. This article summarizes the characteristics of complexity and its implications for informed US state policy making.
Western, Jon, Haas, Peter M
core +1 more source
Is Systems Complexity a Property in a Functional State Space of Each System?
, 2022 Human-Centric Functional Modeling has been proposed as a universal approach towards defining representations of the behavior of systems in terms of “functional state spaces”.
Andy E Williams, Williams, Andy
core +1 more source
State Complexes for Metamorphic Robots [PDF]
The International Journal of Robotics Research, 2004 A metamorphic robotic system is an aggregate of homogeneous robot units which can individually and selectively locomote in such a way as to change the global shape of the system. We introduce a mathematical framework for defining and analyzing general metamorphic robots.
Aaron Abrams, Robert Ghrist
openaire +2 more sources
Nondeterministic State Complexity for Suffix-Free Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We investigate the nondeterministic state complexity of basic operations for suffix-free regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worst-case for a minimal ...
Yo-Sub Han, Kai Salomaa
doaj +1 more source
Journal of Language Modelling, 2019 A recently proposed balanced-bracket encoding (Yli-Jyrä and GómezRodríguez 2017) has given us a way to embed all noncrossing dependency graphs into the string space and to formulate their exact arcfactored inference problem (Kuhlmann and Johnsson 2015 ...
Anssi Mikael Yli-Jyrä
doaj +1 more source
State Complexity of Suffix Distance [PDF]
International Journal of Foundations of Computer Science, 2017 The neighbourhood of a regular language with respect to the prefix, suffix and subword distance is always regular and a tight bound for the state complexity of prefix distance neighbourhoods is known. We give upper bounds for the state complexity of the neighbourhood of radius [Formula: see text] of an [Formula: see text]-state deterministic finite ...
Timothy Ng 0001 +2 more
openaire +3 more sources
pyObs: Open-Source Software for Computer-Assisted Behavioral Observation Coding
Journal of Open Research Software, 2018 pyObs is a computer-assisted behavioral observation coding system used to record social interaction among children in classroom and playground settings.
William A. Griffin
doaj +1 more source
Holographic Interpretation of Relative State Complexity
Universe, 2020 We investigate a large-N conformal field theory (CFT) in a high-energy pure state coupled to a small auxiliary system of M weakly-interacting degrees of freedom, and argue the relative state complexity of the auxiliary system is holographically dual to ...
Alexander Yosifov +2 more
doaj +1 more source
State Complexity of Overlap Assembly [PDF]
International Journal of Foundations of Computer Science, 2018 The state complexity of a regular language [Formula: see text] is the number [Formula: see text] of states in a minimal deterministic finite automaton (DFA) accepting [Formula: see text]. The state complexity of a regularity-preserving binary operation on regular languages is defined as the maximal state complexity of the result of the operation where
Janusz A. Brzozowski +3 more
openaire +2 more sources