Groups, graphs, languages, automata, games and second-order monadic logic

Authors:
Tullio Ceccherini-Silberstein;Michel Coornaert;Francesca Fiorenzi;Paul E. Schupp
Affiliations:
Dipartimento di Ingegneria, Universití del Sannio, C.so Garibaldi 107, 82100 Benevento, Italy;Institut de Recherche Mathématique Avancée, UMR 7501, Université de Strasbourg et CNRS, 7 rue René-Descartes, 67000 Strasbourg, France;Laboratoire de Recherche en Informatique, Université Paris-Sud 11, 91405 Orsay Cedex, France;Department of Mathematics, University of Illinois at Urbana-Champaign, 1409 W. Green Street (MC-382) Urbana, IL 61801-2975, USA
Venue:
European Journal of Combinatorics
Year:
2012

Citing 23
Cited 0

Alternating automata on infinite trees

Theoretical Computer Science
Graphs and groups with tree-like properties

Journal of Combinatorial Theory Series B
Reversibility of 2D cellular automata is undecidable

Physica D
Garden of Eden configurations for cellular automata on Cayley graphs of groups

SIAM Journal on Discrete Mathematics
Reversibility and surjectivity problems of cellular automata

Journal of Computer and System Sciences
Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra

Theoretical Computer Science
An example of an indexed language of intermediate growth

Theoretical Computer Science
The growth function of context-free languages

Theoretical Computer Science
Word Processing in Groups

Word Processing in Groups
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Context-free languages of sub-exponential growth

Journal of Computer and System Sciences
An Effective Version of Stallings' Theorem in the Case of Context-Free Groups

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Trees, automata, and games

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On the entropy of regular languages

Theoretical Computer Science - WORDS
Growth-sensitivity of context-free languages

Theoretical Computer Science - WORDS
Theory of cellular automata: a survey

Theoretical Computer Science
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata
Infinite sequences and finite machines

SWCT '63 Proceedings of the 1963 Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design
The domino problem of the hyperbolic plane is undecidable

Theoretical Computer Science
A Course in Formal Languages, Automata and Groups

A Course in Formal Languages, Automata and Groups
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures

Journal of Computer and System Sciences
Context-free pairs of groups I: Context-free pairs and graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we survey some surprising connections between group theory, the theory of automata and formal languages, the theory of ends, infinite games of perfect information, and monadic second-order logic.