An ergodic theorem for read-once non-uniform deterministic finite automata

DOI10.1016/S0020-0190(99)00162-3zbMATH Open0953.68567OpenAlexW2051312246WikidataQ126557122 ScholiaQ126557122MaRDI QIDQ1583045FDOQ1583045

R. Smith

Publication date: 26 October 2000

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00162-3

zbMATH Keywords

automataformal languagestheory of computationergodic theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites Work

• Title not available (Why is that?)
• Generating a random permutation with random transpositions
• Finite monoids and the fine structure of NC ¹
• Title not available (Why is that?)
• Superlinear lower bounds for bounded-width branching programs

Cited In (1)

• MONOIDS AND COMPUTATIONS

This page was built for publication: An ergodic theorem for read-once non-uniform deterministic finite automata

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