Topological design of sculptured surfaces
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Discrete groups and visualization of three-dimensional manifolds
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
The growth rate of vertex-transitive planar graphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Computation in word-hyperbolic groups (invited talk abstract)
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Journal of Symbolic Computation
Extensions and submonoids of automatic monoids
Theoretical Computer Science
Restricted rotation distance between binary trees
Information Processing Letters
The homomorphism problem for the free monoid
Discrete Mathematics
Dependency Analysis of Recursive Data Structures Using Automatic Groups
LCPC '98 Proceedings of the 11th International Workshop on Languages and Compilers for Parallel Computing
Automatic Graphs and Graph D0L-Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Applications of Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Hyperbolic Recognition by Graph Automata
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
New Public-Key Cryptosystem Using Braid Groups
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Pseudorandomness from Braid Groups
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
An Efficient Implementation of Braid Groups
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
A Short Introduction to Infinite Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Divisibility Monoids: Presentation, Word Problem, and Rational Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Safe Approximation of Data Dependencies in Pointer-Based Structures
LCPC '00 Proceedings of the 13th International Workshop on Languages and Compilers for Parallel Computing-Revised Papers
A result on braids via the investigation of a rewriting system
Journal of Symbolic Computation
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Automatic structures: overview and future directions
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Computer algebra handbook
On the entropy of regular languages
Theoretical Computer Science - WORDS
The homomorphism problem for trace monoids
Theoretical Computer Science - WORDS
Automatic graphs and D0L-sequences of finite graphs
Journal of Computer and System Sciences
Bounding restricted rotation distance
Information Processing Letters
On the infinigons of the hyperbolic plane, a combinatorial approach
Fundamenta Informaticae
String rewriting and homology of monoids
Mathematical Structures in Computer Science
Nordic Journal of Computing
Islamic star patterns in absolute geometry
ACM Transactions on Graphics (TOG)
The synthesis of petri nets from path-automatic specifications
Information and Computation
Garside monoids vs divisibility monoids
Mathematical Structures in Computer Science
Automatic linear orders and trees
ACM Transactions on Computational Logic (TOCL)
A Weak Key Test for Braid Based Cryptography
Designs, Codes and Cryptography
A structural approach to reversible computation
Theoretical Computer Science
Automatic semigroups and categories
Theoretical Computer Science
Entity authentication schemes using braid word reduction
Discrete Applied Mathematics - Special issue: Coding and cryptography
A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
Theoretical Computer Science
Finite transducers for divisibility monoids
Theoretical Computer Science
The origins of combinatorics on words
European Journal of Combinatorics
Combinatorics of normal sequences of braids
Journal of Combinatorial Theory Series A
A geometric characterization of automatic semigroups
Theoretical Computer Science
The algebra of metric betweenness I: Subdirect representation and retraction
European Journal of Combinatorics
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Automatic Presentations for Cancellative Semigroups
Language and Automata Theory and Applications
On the cycling operation in braid groups
Discrete Applied Mathematics
Efficient solutions to the braid isotopy problem
Discrete Applied Mathematics
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
Theoretical Computer Science
Regular production systems and triangle tilings
Theoretical Computer Science
Counting powers of words in monoids
European Journal of Combinatorics
Theories of Automatic Structures and Their Complexity
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Automatic presentations for semigroups
Information and Computation
Church-Rosser groups and growing context-sensitive groups
Journal of Automata, Languages and Combinatorics
Notions of hyperbolicity in monoids
Theoretical Computer Science
Generating series of the trace group
DLT'03 Proceedings of the 7th international conference on Developments in language theory
A rewriting alternative to Reidemeister-Schreier
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Length based attack and braid groups: cryptanalysis of Anshel-Anshel-Goldfeld key exchange protocol
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Model theoretic complexity of automatic structures
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
On the distance between the expressions of a permutation
European Journal of Combinatorics
Cellular Automata, Decidability and Phasespace
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Automatic structures and groups
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Singular artin monoids of finite coxeter type are automatic
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Solving word problems in group extensions over infinite words
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Computing shortest words via shortest loops on hyperbolic surfaces
Computer-Aided Design
Beyond iteration vectors: instancewise relational abstract domains
SAS'06 Proceedings of the 13th international conference on Static Analysis
Invariants of automatic presentations and semi-synchronous transductions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
First-order and counting theories of ω-automatic structures
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Automatic presentations for finitely generated groups
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A practical attack on a braid group based cryptographic protocol
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Context-Sensitive decision problems in groups
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Decidability and complexity in automatic monoids
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Where automatic structures benefit from weighted automata
Algebraic Foundations in Computer Science
Groups, graphs, languages, automata, games and second-order monadic logic
European Journal of Combinatorics
Cayley graph automatic groups are not necessarily cayley graph biautomatic
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Automaton ranks of some self-similar groups
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Logspace computations in graph groups and coxeter groups
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The Complexity of Verbal Languages over Groups
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Groups and automata: a perfect match
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Iterating invertible binary transducers
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
On the Infinigons of the Hyperbolic Plane, A combinatorial approach
Fundamenta Informaticae
Journal of Combinatorial Theory Series A
Computing growth functions of braid monoids and counting vertex-labelled bipartite graphs
Journal of Combinatorial Theory Series A
Notions of hyperbolicity in monoids
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Efficient computation in groups via compression
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Automatic learners with feedback queries
Journal of Computer and System Sciences
Hi-index | 0.01 |
From the Publisher:This study in combinatorial group theory introduces the concept of automatic groups. It contains a succinct introduction to the theory of regular languages, a discussion of related topics in combinatorial group theory, and the connections between automatic groups and geometry which motivated the development of this new theory. It is of interest to mathematicians and computer scientists and includes open problems that will dominate the research for years to come.