2000 character limit reached
Language Classes Associated with Automata Over Matrix Groups
Published 1 Sep 2016 in cs.FL | (1609.00396v1)
Abstract: We investigate the language classes recognized by group automata over matrix groups. We present a summary of the results obtained so far together with a number of new results. We look at the computational power of time-bounded group automata where the group under consideration has polynomial growth.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
