Combinatorics , Automata and Number Theory CANT
نویسندگان
چکیده
129 adic, 130 canonical (CNS), 93 Dumont-Thomas, 333, 516 linear, 81 positional, 125 scale, 80, 125 numerical value, 41 S-numerical value, 129 occurrence, 355 odometer, 177, 350, 415, 500, 515 base, 350 ω-equivalent D0L systems, 520 HDOL systems, 164 one-sided shift, 43 orbit, 388 equivalent, 368 strongly, 368 of a word, 43 order genealogical, 24 lexicographic, 24, 342 radix, 24 unit, 365, 366 ordered, 341 Bratteli diagram, 341 group, 365 properly, 343 ordering consecutive, 372 ordinary bispecial factor, 188, 249 Oseledec, V. I., 405 overlap, 311, 433, 557 graph, 314 coincidence, 312 equivalent, 312 half-coincidence, 312 Oxtoby, J., 395 palindrome, 19, 448 palindromic density, 457 Pansiot’s theorem, 201 Pansiot, J.-J., 177, 200, 201, 522, 523, 543 paperfolding word, 198 Parikh mapping, 21 Parikh vector, 207 Parry number, 73 Parry, W., 73 partial quotients, 442 partition clopen, 344 Kakutani-Rohlin, 344 KR, 344 patch, 274 ancestor, 295 equivalent, 274 path, 31 Bratteli diagram, 343 cofinal, 343 label, 31 space, 343 successful, 31 Păun, G., 149 Pell equation, 152 period, 23 period cycle, 180 period-doubling word, 258 periodic word, 23, 180 Perron number, 119 Perron–Frobenius eigenvalue, 38 normalised eigenvector, 39 theorem, 38, 264 Petersen, K., 419 Pethö, A., 98, 99 p-expansion, 41, 54 p q -expansion, 101 Pisot conjecture, 285 morphism, 39
منابع مشابه
Groups and Automata: a Perfect Match
We present a personal perspective, inspired by our own research experience, of the interaction between group theory and automata theory: from Benois’ Theorem to Stallings’ automata, from hyperbolic to automatic groups, not forgetting the exotic automaton groups.
متن کاملSome Combinatorial Operators in Language Theory
Multitildes are regular operators that were introduced by Caron et al. in order to increase the number of Glushkov automata. In this paper, we study the family of the multitilde operators from an algebraic point of view using the notion of operad. This leads to a combinatorial description of already known results as well as new results on compositions, actions and enumerations.
متن کاملHigher Dimensional Automata
We provide the basics of a 2-dimensional theory of automata on series-parallel biposets. We define recognizable, regular and rational sets of series-parallel biposets and study their relationship. Moreover, we relate these classes to languages of series-parallel biposets definable in monadic second-order logic.
متن کاملOn the Number of Distinct Languages Accepted by Finite Automata with n States
We give asymptotic estimates and some explicit computations for both the number of distinct languages and the number of distinct finite languages over a k-letter alphabet that are accepted by deterministic finite automata (resp. nondeterministic finite automata) with n states.
متن کاملWeighted Finite Automata and Metrics in Cantor Space
We show how weighted finite automata define topologies on the set of all ω-words over a finite alphabet X . Moreover, we give a characterization of these topologies in terms of topologies on Xω induces by languages U ⊆ X∗.
متن کاملFormal Tree Series
In this survey we generalize some results on formal tree languages, tree grammars and tree automata by an algebraic treatment using semirings, fixed point theory, formal tree series and matrices. The use of these mathematical constructs makes definitions, constructions, and proofs more satisfactory from an mathematical point of view than the customary ones. The contents of this survey paper is ...
متن کامل