arXiv (All)
open access
Rational Reductions and Regular Languages of Constant Circuit Complexity
We study the circuit complexity of regular languages in terms of unbounded fan-in Boolean circuit families. We characterize the regular languages of constant circuit complexity in terms of the one-variable fragment of first-order logic with regular predicates, in terms of the pseudovariety of stamps
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Non-branching Clause#778434
- States of Affairs as Structured Extensions in Free Logic#747794
- Representation of arbitrary rational functions and polynomials by non-Foster resistor-capacitor-inductor networks#973657
- The Sure-thing Principle and P2#748891
- A Resolution Method for Quantified Modal Logics of Knowledge and Belief#706441
Record · ID 1012666
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive