Non-uniform automata over groups (Q804303): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0890-5401(90)90007-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1500453128 / rank | |||
Normal rank | |||
Revision as of 20:25, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-uniform automata over groups |
scientific article |
Statements
Non-uniform automata over groups (English)
0 references
1990
0 references
Non-uniform deterministic finite automata (NUDFA's) over general finite monoids have recently been developed as a link between the theory of finite automata and low-lewel parallel complexity. The paper under review extends this theory to NUDFA's over solvable groups. The authors characterize the power of NUDFA's over nilpotent groups and prove some optimal lower bounds for NUDFA's over certain groups which are solvable but not nilpotent.
0 references
Non-uniform deterministic finite automata
0 references
parallel complexity
0 references
solvable groups
0 references
