scientific article; zbMATH DE number 3934415

MaRDI QIDQ3706507zbMATH OpenFDO

Authors V. G. Skobelev

Publication date 1984

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Almost optimal bound of recurrent word length for regular automata
• Birecurrent sets
• scientific article; zbMATH DE number 3913686
• Exact enumeration of acyclic deterministic automata
• Asymptotic enumeration of minimal automata

Cited in

(14)

• The method of forced enumeration for nondeterministic automata
• Almost optimal bound of recurrent word length for regular automata
• scientific article; zbMATH DE number 3913686 (Why is no real title available?)
• scientific article; zbMATH DE number 3918355 (Why is no real title available?)
• scientific article; zbMATH DE number 3933047 (Why is no real title available?)
• scientific article; zbMATH DE number 3948238 (Why is no real title available?)
• On the number of finite automata stabilized at a fixed state by a constant input
• Enumerated BSP Automata
• scientific article; zbMATH DE number 2086415 (Why is no real title available?)
• scientific article; zbMATH DE number 822047 (Why is no real title available?)
• An algorithm for enumerating all infinite repetitions in a D0L-system
• Skeleton automata
• Applications of the finite state automata for counting restricted permutations and variations
• Enumeration and random generation of accessible automata

This page was built for publication:

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