All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 45 Next

Displaying 881 – 900 of 4962

Showing per page

Automata with modulo counters and nondeterministic counter bounds

Daniel Reidenbach, Markus L. Schmid (2014)

Kybernetika

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 sound...

Automata with two-sided pushdowns defined over free groups generated by reduced alphabets

Petr Blatný, Radek Bidlo, Alexander Meduna (2007)

Kybernetika

This paper introduces and discusses a modification of pushdown automata. This modification is based on two-sided pushdowns into which symbols are pushed from both ends. These pushdowns are defined over free groups, not free monoids, and they can be shortened only by the standard group reduction. We demonstrate that these automata characterize the family of recursively enumerable languages even if the free groups are generated by no more than four symbols.

Automata-based representations for infinite graphs

Salvatore La Torre, Margherita Napoli (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

New compact representations of infinite graphs are investigated. Finite automata are used to represent labelled hyper-graphs which can be also multi-graphs. Our approach consists of a general framework where vertices are represented by a regular prefix-free language and edges are represented by a regular language and a function over tuples. We consider three different functions over tuples: given a tuple the first function returns its first difference, the second one returns its suffix and the last...

Automata-based Representations for Infinite Graphs

Salvatore La Torre, Margherita Napoli (2010)

RAIRO - Theoretical Informatics and Applications

New compact representations of infinite graphs are investigated. Finite automata are used to represent labelled hyper-graphs which can be also multi-graphs. Our approach consists of a general framework where vertices are represented by a regular prefix-free language and edges are represented by a regular language and a function over tuples. We consider three different functions over tuples: given a tuple the first function returns its first difference, the second one returns its suffix and...

Automated Processing of TeX-Typeset Articles for a Digital Library

Růžička, Michal (2008)

Towards Digital Mathematics Library. Birmingham, United Kingdom, July 27th, 2008

Experience in setting up a comprehensive journal processing system based on the TeX typesetting system with the CEDRAM workflow is described, following the example of the Archivum Mathematicum journal. The system automates the preparation of issues and simultaneously generates the materials needed for the Czech Digital Mathematics Library project (DML-CZ). The second part of the article describes the process of transformation of archival born-digital articles into a DML-CZ-suitable format.

Automates calculant la complexité de suites automatiques

Théodore Tapsoba (1994)

Journal de théorie des nombres de Bordeaux

Le point fixe u d’une substitution injective uniforme de module σ sur un alphabet A est examiné du point de vue du nombre P ( u , n ) de ses blocs distincts de longueur n . Lorsque u est minimal et A de cardinal deux, nous construisons un automate pour la suite n → P ( u , n + 1 ) - P ( u , n ) .

Automates et algébricités

Jean-Paul Allouche (2005)

Journal de Théorie des Nombres de Bordeaux

Dans quelle mesure la régularité des chiffres d’un nombre réel dans une base entière, celle des quotients partiels du développement en fraction continuée d’un nombre réel, ou celle des coefficients d’une série formelle sont-elles liées à l’algébricité ou à la transcendance de ce réel ou de cette série formelle  ? Nous proposons un survol de résultats récents dans le cas où la régularité évoquée ci-dessus est celle de suites automatiques, substitutives, ou sturmiennes.

Automates et codes zigzag

Marcella Anselmo (1991)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Automates finis

Dominique Perrin, Jacques Sakarovitch (1982)

Publications du Département de mathématiques (Lyon)

Automates finis et ensembles normaux

Christian Mauduit (1986)

Annales de l'institut Fourier

Soit u = ( u n ) n ∈ N une suite strictement croissante d’entiers reconnaissable par un automate fini. Nous montrons qu’une condition nécessaire et suffisante pour que l’ensemble normal associé a u soit exactement R ∖ Q est que l’un au moins des sommets qui reconnaît la suite u soit précédé dans le graphe de l’automate par un sommet possédant au moins deux circuits fermés distincts. Cette condition peut se traduire quantitativement en disant que la suite u doit être plus “dense” que toute suite exponentielle.

Currently displaying 881 – 900 of 4962