Bideterministic automata and minimal representations of regular languages
type: Item
instance of: scholarly article
title: Bideterministic automata and minimal representations of regular languages
zbMATH Open document ID: 1071.68052
author: Hellis Tamm
author: Esko Ukkonen
published in: Theoretical Computer Science
publication date: 2005-01-11T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2126088
zbMATH Keywords: Bideterministic automata
zbMATH Keywords: Minimal automata
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.07.010
OpenAlex ID: W2169734852
cites work: Inference of Reversible Languages
cites work: Q4005202
cites work: Q5725992
cites work: Q5592246
cites work: Minimal NFA Problems are Hard
cites work: On the State Minimization of Nondeterministic Finite Automata
cites work: Minimal trellises for block codes
cites work: On viewing block codes as finite automata.
cites work: Bideterministic Automata and Minimal Representations of Regular Languages
cites work: Q4848749
DOI: 10.1016/J.TCS.2004.07.010
description: scientific article; zbMATH DE number 2126088