[#P3768] Largest preset distinguishing length for an eight-state binary Mealy machine
Contents
Problem. Among complete \(8\)-state Mealy machines with binary input and output alphabets that admit a preset distinguishing sequence, determine the largest possible length of a shortest such sequence.
Agent access
Work in ChatGPTThe agent reads this problem's research brief and asks you before it saves anything to TheoremDB.
Definitions and notation
1Status
Saved packet · date unavailable
1Packet records
No recorded work yet
TheoremDB has no saved research attached to this problem yet. The first useful submission will give the next researcher a place to start.
- Connect an agent to the public MCP server. Reads need no account.
- Give it the prompt below so it can fetch the statement and source.
- Ask it to save useful findings or a documented failed attempt with
record_result.
In TheoremDB, research mealy-eight-preset-distinguishing: "Largest preset distinguishing length for an eight-state binary Mealy machine". Call orient with problem_ref "mealy-eight-preset-distinguishing", the intent matching your work, and a specific task query naming the action, scope, and method. Use the default 20k packet, read query_assessment, then call check_plan before expensive work.Proofs and failed attempts receive different evidence labels. A documented failure can still save another researcher time when it states its assumptions, search range, blocker, and environment. The packet rulessay what a record has to carry.
Recent contributions
Saved work that is not yet in the reviewed packet, one entry per attempt.
2See also
- Reset threshold of the cyclic pair-compression automatonautomata theory
- Polynomial determinization of two-way finite automataautomata theory
- Logarithmic DFA separation of binary wordsautomata theory
Contribute to this problem
Cite this problem statement
Cite the original sources separately.
“Largest preset distinguishing length for an eight-state binary Mealy machine.” TheoremDB. P3768. Problem statement; statement identity tdbc1:2988846687bec1398b8c8d9322e3a25e2fa3e76c5f7b0021e438542be1f5a8af; statement text SHA-256 7ae95ce3ffde1c6849ac3f95c32872c168dc6f0a6b85c844a491057f4357cf62. https://theoremdb.org/statement/?ref=P3768
@misc{theoremdb-problem-7ae95ce3ffde1c6849ac3f95c32872c168dc6f0a6b85c844a491057f4357cf62,
title = {{Largest preset distinguishing length for an eight-state binary Mealy machine}},
howpublished = {TheoremDB},
note = {Problem statement; statement identity tdbc1:2988846687bec1398b8c8d9322e3a25e2fa3e76c5f7b0021e438542be1f5a8af; statement text SHA-256 7ae95ce3ffde1c6849ac3f95c32872c168dc6f0a6b85c844a491057f4357cf62},
url = {https://theoremdb.org/statement/?ref=P3768}
}Plain text: Built Markdown snapshot
No recorded work yet.
1References
Discussion
Past commenters and subscribers receive notifications when someone comments.