搜索结果: 1-7 共查到“数学 languages”相关记录7条 . 查询时间(0.062 秒)
ω-stable theories: Do uncountable languages matter?
ω-stable theories uncountable languages matter
2015/9/25
ω-stable theories: Do uncountable languages matter?
Decision Problems for Recognizable Languages of Infinite Pictures
Languages of infinite pictures recognizability by tiling systems decision problems unambiguity problem cardinality problems
2011/9/23
Abstract: Altenbernd, Thomas and W\"ohrle have considered in [ATW02] acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance c...
Factor frequencies in languages invariant under more symmetries
Factor frequencies languages invariant Combinatorics
2011/8/24
Abstract: The number of frequencies of factors of length $n+1$ in a recurrent aperiodic infinite word does not exceed $3\Delta \C(n)$, where $\Delta \C (n)$ is the first difference of factor complexit...
Lamplighter Random Walks and Entropy-Sensitivity of Languages
Lamplighter Random Walks Entropy-Sensitivity of Languages
2011/1/21
I declare that I have authored this thesis independently, that I have not used other than the declared sources/resources, and that I have explicitely marked all material which has been quotes either l...
Tiling-Recognizable Two-Dimensional Languages: From Non-Determinism to Determinism through Unambiguity
automata and formal Languages two-dimensional languages
2010/12/28
Tiling recognizable two-dimensional languages, also known as REC,generalize recognizable string languages to two dimensions and share with them several theoretical properties. Nevertheless REC is not ...
Numerical values of the growth rates of power-free languages
Numerical values growth rates power-free languages
2010/12/16
We present upper and two-sided bounds of the exponential growth rate for a wide range of power-free languages. All bounds are obtained with the use of algorithms previously developed by the author.
We introduce non deterministic monoid recognizability (NDMR) of fuzzy languages and we show its equivalence with the deterministic version. Thus, fuzzy automata over the pairs (max, min), (max,ΔL), (m...