An ergodic theorem for read-once non-uniform deterministic finite automata
type: Item
instance of: scholarly article
title: An ergodic theorem for read-once non-uniform deterministic finite automata
zbMATH Open document ID: 0953.68567
DOI: 10.1016/S0020-0190(99)00162-3
author: R. Smith
published in: Information Processing Letters
publication date: 2000-10-26T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 1521611
zbMATH Keywords: automata
zbMATH Keywords: formal languages
zbMATH Keywords: theory of computation
zbMATH Keywords: ergodic theorem
MaRDI profile type: Publication
cites work: Superlinear lower bounds for bounded-width branching programs
cites work: Finite monoids and the fine structure of NC 1
cites work: Q3995195
cites work: Generating a random permutation with random transpositions
cites work: Q3779765
Wikidata QID: Q126557122
full work available at URL: s0020-0190(99)00162-3
OpenAlex ID: W2051312246
description: scientific article; zbMATH DE number 1521611