scientific article; zbMATH DE number 4209603

MaRDI QIDQ3357541zbMATH OpenFDO

Authors Craig A. Rich, Giora Slutzki

Publication date 1990

zbMATH Keywords

finite-state automaton

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4092773
• Notes on counting with finite machines
• Counting with probabilistic and ultrametric finite automata
• Automaticity. I: Properties of a measure of descriptional complexity
• Automaticity. II: Descriptional complexity in the unary case

Cited in

(8)

• On the number of active states in finite automata
• Counting nondeterministic computations
• Counting with probabilistic and ultrametric finite automata
• Notes on counting with finite machines
• Running Time Complexity of Printing an Acyclic Automaton
• scientific article; zbMATH DE number 4092773 (Why is no real title available?)
• Applications of the finite state automata for counting restricted permutations and variations
• Magic Numbers in the State Hierarchy of Finite 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 Q3357541)