Regular languages in \(NC\) (Q1191027): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Kevin J. Compton / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Denis Thérien / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Jozef Vyskoč / rank | |||
Normal rank |
Revision as of 09:09, 16 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Regular languages in \(NC\) |
scientific article |
Statements
Regular languages in \(NC\) (English)
0 references
27 September 1992
0 references
The paper deals with the problem of recognition of regular languages by the circuits of certain type. The theory of the syntactic monoid of a regular language is used to present various characterizations of the regular languages in the circuit complexity class \(AC^ 0\). Also an effective procedure for deciding the membership of a regular language in \(AC^ 0\) is given, thus answering the decidability question concerning this problem. Variants of the results concerning circuits with gates that compute the sum of the inputs modulo a fixed prime are considered as well.
0 references
regular languages
0 references
syntactic monoid
0 references
circuit complexity class
0 references