On groups that have normal forms computable in logspace

Autor: Elder, Murray, Elston, Gillian, Ostheimer, Gretchen

We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite index subgroups, direct products, wreath products, and also certain f

Externí odkaz: http://arxiv.org/abs/1201.4363

The word problem distinguishes counter languages

Autor: Cleary, Sean, Elder, Murray, Ostheimer, Gretchen

Counter automata are more powerful versions of finite-state automata where addition and subtraction operations are permitted on a set of n integer registers, called counters. We show that the word problem of $\Z^n$ is accepted by a nondeterministic $

Externí odkaz: http://arxiv.org/abs/math/0606415

The word problem distinguishes counter languages

Autor: Cleary, Sean, Elder, Murray, Ostheimer, Gretchen, Universitat Autònoma de Barcelona. Centre de Recerca Matemàtica

Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname
Dipòsit Digital de Documents de la UAB
Universitat Autònoma de Barcelona
Recercat: Dipósit de la Recerca de Catalunya
Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)

Counter automata are more powerful versions of finite state automata where addition and subtraction operations are permitted on a set of n integer registers, called counters. We show that the word problem of Zn is accepted by a nondeterministic m-cou

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d5377e3eb3fa4da54ab14728e540ddcc
http://hdl.handle.net/2072/418734

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.