BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Graph explorer

Completely Reachable Automata

We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word.

4 nodes3 linksoverview mapCompletely Reachable Automata
SearchCollections
4 nodes3 links
Completely Reachable Automata4 visible / 4 total nodes / 4 links
Co-authorshipAuthorshipAuthorshipTopic signalWCompletely Reachable Automatapreprint / 2016AEvgenija BondarResearcherAMikhail VolkovResearcherTFormal Languages and Au...714 works
PaperSignal 103 links

Completely Reachable Automata

preprint / 2016

Open

Personal maps

Sign in to save graph views

Saved views keep the query, focus and filters attached so you can return to the same research slice later.

Sign in

Public snapshots

1 shared view(s)