scientific article; zbMATH DE number 4092773

MaRDI QIDQ3820007zbMATH OpenFDO

Authors Craig A. Rich, Giora Slutzki

Publication date 1988

zbMATH Keywords

computable functionscounting finite-state automatacounting functionnondeterministic automatapumping behavior

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4209603
• Notes on counting with finite machines
• Counting with probabilistic and ultrametric finite automata
• Automaticity. I: Properties of a measure of descriptional complexity
• scientific article; zbMATH DE number 4001492

Cited in

(6)

• On the number of active states in finite automata
• Counting with probabilistic and ultrametric finite automata
• Notes on counting with finite machines
• scientific article; zbMATH DE number 4209603 (Why is no real title available?)
• Running Time Complexity of Printing an Acyclic Automaton
• Applications of the finite state automata for counting restricted permutations and variations

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 Q3820007)