scientific article

zbMATH Open0667.68058MaRDI QIDQ3820007FDOQ3820007

Giora Slutzki, Craig A. Rich

Publication date: 1988

Title of this publication is not available (Why is that?)

zbMATH Keywords

computable functionscounting functionnondeterministic automatacounting finite-state automatapumping behavior

Mathematics Subject Classification ID

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

Cited In (3)

• Applications of the finite state automata for counting restricted permutations and variations
• On the number of active states in finite automata
• Running Time Complexity of Printing an Acyclic Automaton

   Recommendations

• Title not available (Why is that?) 👍 👎
• Notes on counting with finite machines 👍 👎
• Counting with Probabilistic and Ultrametric Finite Automata 👍 👎
• Automaticity. I: Properties of a measure of descriptional complexity 👍 👎
• Title not available (Why is that?) 👍 👎

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)