On completely reachable automata and subset reachability

DOI10.1007/978-3-319-98654-8_27OpenAlexW2801818712MaRDI QIDQ1622980FDOQ1622980

Authors: François Gonze, Raphaël M. Jungers 

Publication date: 22 November 2018

Full work available at URL: https://arxiv.org/abs/1805.02540

Recommendations

• Hardly reachable subsets and completely reachable automata with 1-deficient words
• A characterization of completely reachable automata
• Subset synchronization of transitive automata
• Completely reachable automata
• Subset synchronization in monotonic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (10)

• Hardly reachable subsets and completely reachable automata with 1-deficient words
• Preimage problems for deterministic finite automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA
• The length of subset reachability in nondeterministic automata
• Binary completely reachable automata
• Completely reachable automata
• Turing-Complete Subclasses of CHR
• A characterization of completely reachable automata

This page was built for publication: On completely reachable automata and subset reachability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1622980)