On completely reachable automata and subset reachability

DOI10.1007/978-3-319-98654-8_27MaRDI QIDQ1622980zbMATH OpenOpenAlexFDO

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

Publication date 22 November 2018

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cited in

(10)

• A characterization of completely reachable automata
• Turing-Complete Subclasses of CHR
• Hardly reachable subsets and completely reachable automata with 1-deficient words
• Preimage problems for deterministic finite automata
• scientific article; zbMATH DE number 7168170 (Why is no real title available?)
• scientific article; zbMATH DE number 1836354 (Why is no real title available?)
• THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA
• The length of subset reachability in nondeterministic automata
• Binary completely reachable automata
• 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)