---
title: 2NFAs with Common Guess
url: https://www.emergentmind.com/topics/2nfas-with-common-guess
type: topic
---

# 2NFAs with Common Guess

Searching arXiv for the cited papers and closely related work on common-guess automata and limited automata.
arXiv_search(query="all:\"2NFA with common guess\" OR all:\"common guess\" automata OR all:\"1-limited automata\" unary", max_results=10, sort_by="submittedDate")
arXiv_search(query="id:2507.11209 OR id:2504.08464 OR id:0811.2586", max_results=10, sort_by="relevance")
A **2NFA with common guess** is a two-way finite-state device in which nondeterminism is concentrated into a single shared annotation, or “guess,” fixed for the whole input before the read-only verification phase begins. In one formulation, the machine is a 2NFA equipped with a new kind of nondeterminism that initially annotates each input symbol and then performs a read-only computation over the resulting annotated word [2504.08464]. In another, closely related formulation, it is a restricted 1-limited automaton operating on an input paired with a global annotation track and verifying that annotation incrementally [2507.11209]. The defining feature is that the guessed object is **common** across the computation, rather than re-chosen independently at each nondeterministic branch. A broader antecedent appears in the auxiliary-memory framework of automata with read-only guessed memory, where acceptance means that there exists a single memory content on which an otherwise deterministic machine accepts [0811.2586].

## 1. Definition and semantic core

The common-guess model is introduced in the recent literature as part of the study of 1-limited automata and two-way automata. In the formulation used in "Nondeterminism makes unary 1-limited automata concise" [2504.08464], a **2NFA with common guess** (\(2\mathrm{NFA}+cg\)) is a 2NFA that may initially annotate each input symbol and then run a read-only computation on the annotated word. This separates computation into two phases: an annotation phase and a verification phase.

A more concrete encoding is given in "Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata" [2507.11209]. There the input is viewed as a word
\[
x \in (\Sigma\times\{0,1\})^*,
\]
with projection maps \(\pi_1(x)\) for the original input and \(\pi_2(x)\) for the annotation bits. The “common guess” is the entire second track. It is **global and shared across the whole input**, rather than produced locally at each step.

This semantic structure distinguishes common-guess automata from ordinary nondeterministic automata. In standard nondeterminism, branching is embedded in the transition relation. In the common-guess setting, the nondeterministic resource is a single guessed object that all later verification steps consult. The auxiliary-memory model of Kintali and others makes this distinction explicit: an automaton with auxiliary memory is deterministic relative to a fixed memory content \(\mu\), and a word is accepted iff there exists some \(\mu\) making the run accepting [0811.2586]. This suggests that common-guess automata are best understood as **certificate-verifying** two-way devices rather than merely as branching automata.

## 2. Relation to 1-limited automata and deterministic counterparts

The model is studied in direct connection with **1-limited automata** (1-LAs), which are presented as an extension of two-way finite automata characterizing regular languages [2504.08464]. Within that landscape, 2NFAs with common guess are treated as a restricted form of 1-LA [2507.11209].

| Model | Characterization in the cited literature |
|---|---|
| \(2\mathrm{NFA}+cg\) | 2NFA with an initial common annotation phase [2504.08464] |
| \(2\mathrm{DFA}+cg\) | Deterministic verification phase with a nondeterministic annotation phase [2504.08464] |
| 1-LA | Extension of 2NFAs; \(2\mathrm{NFA}+cg\) appears as a restricted form [2507.11209] |

The deterministic counterpart is especially notable. The cited work states that **two-way deterministic finite automata with common guess** (\(2\mathrm{DFA}+cg\)) still possess a nondeterministic annotation phase and can be considered a restriction of 1-LAs [2504.08464]. Accordingly, “deterministic” here does not mean fully deterministic computation in the usual DFA sense. The deterministic aspect applies to the read-only verification phase, while the annotation itself remains guessed.

This distinction matters in descriptional complexity. A model may be deterministic during verification while still drawing substantial succinctness from the guessed annotation. A common misconception is therefore to equate \(2\mathrm{DFA}+cg\) with ordinary 2DFAs; the cited results rule that out directly, because the common-guess phase carries nontrivial computational content [2504.08464].

## 3. Canonical annotations and self-verification

The most explicit operational account of common-guess automata is the **self-verifying** construction in [2507.11209]. Let \(\mathcal A\) be an automaton with state set \(Q=\{1,\dots,n\}\). For a word \(w\), the annotation is organized in blocks of length \(n\), and a subset \(S\subseteq Q\) is encoded by a binary word \(\encode{S}\) of length \(n\) such that
\[
\encode{S}[p]=1 \iff p\in S.
\]

The annotation records reachable-state sets for prefixes of the input. If \(Q^\mathcal A(w)\) denotes the set of states reachable after reading \(w\), then the \(i\)-th annotation block encodes
\[
Q^\mathcal A\bigl(w[0,i\cdot n-1]\bigr).
\]
The canonical annotation \(\annot{w}\) is defined recursively by decomposing \(|w|=kn+r\) with \(0\le r<n\), and appending either a full reachable-set encoding or trailing zeros, depending on whether the current prefix ends at a block boundary [2507.11209].

Verification is performed by finite-state procedures that check local consistency of the global guess. The paper identifies the subprocedures \(\enumQX(m)\), \(\memberQX(q_t,m)\), and \(\countnextQX(m)\). The central inductive relation used in the update step is
\[
p\in Q^\mathcal A(u\sigma)
\iff
\exists r\in Q^\mathcal A(u)\text{ such that }p\in\delta(r,\sigma).
\]
Thus the common guess does not merely assert acceptance or rejection; it encodes the **entire evolution** of reachable-state sets and is locally checked block by block.

The same construction is described as self-verifying because correctness is tied to the canonical annotation. The acceptance and rejection requirements are stated as
\[
\mathcal B \text{ accepts } x \iff \pi_1(x)\in L(\mathcal A)\text{ and }x=\annot{\pi_1(x)},
\]
\[
\mathcal B \text{ rejects } x \iff \pi_1(x)\notin L(\mathcal A)\text{ and }x=\annot{\pi_1(x)}.
\]
Malformed annotations need not receive meaningful acceptance semantics. The guessed annotation is therefore a certificate whose role is not merely existential but also **verifiable** in a strong sense.

## 4. Simulation and complementation results

The common-guess model is central to recent complementation results. The 2025 paper on polynomial complementation proves that every unrestricted 2NFA can be complemented by a 1-LA with only polynomial increase in size, and that the resulting machine is in fact a restricted 1-LA, namely a self-verifying \(2\mathrm{NFA}+cg\) [2507.11209]. In the more detailed state-complexity statement extracted from the same work, every \(n\)-state 1-LA has an equivalent self-verifying \(2\mathrm{NFA}+cg\) with polynomially many states, specifically \(\bigO(n^7)\), using only \(2\) annotation symbols [2507.11209].

A corollary concerns complementation of 1-LAs. If an \(n\)-state 1-LA recognizes \(L\subseteq\Sigma^*\), then there exists a 1-LA recognizing \(\Sigma^*\setminus L\) with a **single-exponential** number of states in \(n\) and with \(3|\Sigma|\) work symbols [2507.11209]. The derivation combines a known simulation of an \(n\)-state 1-LA by a machine with at most
\[
n2^{n^2}
\]
states and then applies the polynomial common-guess construction, yielding
\[
\bigO{(n2^{n^2})^7}=2^{\bigO(n^2)}.
\]
The abstract further states that a single exponential is both necessary and sufficient for complementing 1-LAs [2507.11209].

These results make the common-guess model structurally important: it provides a compact certificate format for reachable-set evolution, allowing complementation to be reduced to local verification. A plausible implication is that common-guess structure is not merely a technical variant of 1-LAs but a particularly effective normal form for verification-based constructions.

## 5. Unary lower bounds and descriptional complexity

The common-guess model is also used to prove strong **succinctness separations**. The 2025 paper "Nondeterminism makes unary 1-limited automata concise" studies the descriptional complexity of several 1-LA variants and establishes exponential lower bounds for simulations of \(2\mathrm{DFA}+cg\) by deterministic 1-LAs and by ordinary 2NFAs [2504.08464]. These lower bounds are derived from a **doubly exponential** lower bound for simulation of \(2\mathrm{DFA}+cg\) by one-way deterministic finite automata.

The witnesses are **unary languages**, i.e. languages over a singleton alphabet [2504.08464]. This is a technically significant point because it shows that the succinctness gain is not an artifact of alphabet richness. Even in the unary setting, common-guess annotation can compress behavior that is expensive to reproduce in more standard models.

The same work states that this closes a question left open by Pighizzini and Prigioniero concerning the existence of a double-exponential gap between 1-LAs and 1DFAs in the unary case [2504.08464]. It also proves an exponential lower bound for complementing unary \(2\mathrm{DFA}+cg\), and hence unary 1-LAs. Together with the complementation upper bounds discussed above, these unary results show that common-guess mechanisms are intertwined with both the power and the cost of simulation.

A common misconception is that such lower bounds would disappear on unary inputs because two-way motion and finite control are then less informative. The cited results directly contradict that expectation: the common guess remains descriptionally potent even over a singleton alphabet [2504.08464].

## 6. Broader lineage: shared guesses, auxiliary memory, and restricted certificates

The idea of a shared guessed object predates the recent common-guess automata papers. In "On models of a nondeterministic computation" [0811.2586], nondeterminism is modeled by a deterministic multi-head two-way automaton with read-only access to an auxiliary memory. A memory model is a graph \((M,E)\) with labeled outgoing edges, and a memory content is a mapping
\[
\mu\colon M\to \Delta.
\]
Acceptance is defined existentially over guesses:
\[
w\in L \iff \exists \mu\; A \text{ accepts } w \text{ on } \mu.
\]

This framework emphasizes precisely the feature that later common-guess automata exploit: the computation is deterministic once a single shared guessed structure is fixed. The paper develops several memory models, including one-way, two-way, and \(1.5\)-way tapes, and identifies corresponding complexity classes such as
\[
\mathsf{R}(W_2)=\mathsf{PSPACE},
\qquad
\mathsf{dR}(W_{1.5})=\mathsf{P},
\qquad
\mathsf{R}(W_{1.5})=\mathsf{PSPACE},
\]
as well as restricted-guess characterizations
\[
\mathsf{wR}(U_k,W_{1.5})=\mathsf{NP}\ (k\ge 1),
\qquad
\mathsf{wR}(U_k,W_2)=\mathsf{NP}\ (k\ge 2)
\]
[0811.2586].

That paper does not use the term “2NFA with common guess” verbatim, but it provides a conceptual superstructure in which common-guess semantics can be situated. The recent limited-automata literature specializes this general idea to annotation-based verification over finite words, where the guessed object is placed directly on the input as a second track and checked by a finite-state device [2507.11209]. This suggests a useful taxonomy: ordinary nondeterminism branches locally; auxiliary-memory and common-guess models externalize nondeterminism into a shared certificate.

In current automata theory, 2NFAs with common guess therefore occupy a distinctive position. They are simultaneously a restricted form of 1-limited automaton, an annotation-based extension of two-way automata, and an instance of the broader principle that nondeterminism can be represented by a single globally shared guessed object rather than by unconstrained transition branching [2504.08464].

Source: https://www.emergentmind.com/topics/2nfas-with-common-guess