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

DOI10.1016/S0020-0190(99)00162-3zbMath0953.68567OpenAlexW2051312246WikidataQ126557122 ScholiaQ126557122MaRDI QIDQ1583045

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

automataergodic theoremformal languagestheory of computation

Mathematics Subject Classification ID

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

Related Items (1)

MONOIDS AND COMPUTATIONS

Cites Work

• Superlinear lower bounds for bounded-width branching programs
• Finite monoids and the fine structure of NC ¹
• Generating a random permutation with random transpositions
• Unnamed Item
• Unnamed Item

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