Automata and numeration systems.
Bruyère, Véronique (1995)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Displaying similar documents to “Finite automata and arithmetic.”
Automata and numeration systems.
Finite automata and algebraic extensions of function fields
Kiran S. Kedlaya (2006)
Journal de Théorie des Nombres de Bordeaux
Similarity:
We give an automata-theoretic description of the algebraic closure of the rational function field over a finite field , generalizing a result of Christol. The description occurs within the Hahn-Mal’cev-Neumann field of “generalized power series” over . In passing, we obtain a characterization of well-ordered sets of rational numbers whose base expansions are generated by a finite automaton, and exhibit some techniques for computing in the algebraic closure; these include an adaptation...
A criterion for non-automaticity of sequences.
Schlage-Puchta, Jan-Christoph (2003)
Journal of Integer Sequences [electronic only]
Similarity:
A ridiculously simple and explicit implicit function theorem.
Sokal, Alan D. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Continued fractions, Fibonacci numbers, and some classes of irrational numbers.
Uscka-Wehlou, Hanna (2009)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
On the permutations generated by Sturmian words.
Makarov, M.A. (2009)
Sibirskij Matematicheskij Zhurnal
Similarity:
On finite pseudorandom binary sequences IV: The Liouville function, II
Julien Cassaigne, Sébastien Ferenczi, Christian Mauduit, Joël Rivat, András Sárközy (2000)
Acta Arithmetica
Similarity:
Enumeration of Hamiltonian circuits in rectangular grids.
Stoyan, Robert, Strehl, Volker (1995)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Automata with modulo counters and nondeterministic counter bounds
Daniel Reidenbach, Markus L. Schmid (2014)
Kybernetika
Similarity:
We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are two-way multi-head automata that comprise a constant number of modulo counters, where the counter bounds are nondeterministically guessed, and this is the only element of nondeterminism. NBMCA are tailored to recognising those languages that are characterised by the existence of a specific factorisation of their words, e. g., pattern languages. In this work, we subject NBMCA to a theoretically...