Pages that link to "Item:Q1208406"
From MaRDI portal
The following pages link to Extensions to Barrington's M-program model (Q1208406):
Displaying 15 items.
- The power of programs over monoids in \textbf{J} (Q782588) (← links)
- Generalized quantifier and a bounded arithmetic theory for LOGCFL (Q884960) (← links)
- Languages recognized by finite aperiodic groupoids (Q1274931) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC (Q1317485) (← links)
- McNaughton families of languages. (Q1401181) (← links)
- Circuits and expressions with nonassociative gates (Q1567406) (← links)
- Space complexity of reachability testing in labelled graphs (Q2316928) (← links)
- Cost Register Automata for Nested Words (Q2817901) (← links)
- On Second-Order Monadic Groupoidal Quantifiers (Q3511462) (← links)
- Programs over finite semigroups: An introduction (Q3974006) (← links)
- Finite loops recognize exactly the regular open languages (Q4571944) (← links)
- Complexity analysis of Boolean functions via regular languages---some observations on M-programs over groups (Q4703655) (← links)
- Space Complexity of Reachability Testing in Labelled Graphs (Q5739010) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)