Deterministic generalized automata
type: Item
instance of: scholarly article
title: Deterministic generalized automata
zbMATH Open document ID: 0915.68118
DOI: 10.1016/S0304-3975(97)00166-7
author: Dora Giammarresi
author: Rosa Montalbano
published in: Theoretical Computer Science
publication date: 1999-04-28T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1281079
zbMATH Keywords: regular languages
zbMATH Keywords: generalized automata
zbMATH Keywords: minimal automata
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q4430300
cites work: Finite automata and unary languages
cites work: Q4079524
cites work: Deterministic generalized automata
cites work: Q4448365
cites work: Complexity results for multi-pebble automata and their logics
cites work: Q4036600
cites work: Q5592246
cites work: THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
cites work: Minimal NFA Problems are Hard
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: Minimization algorithms for sequential transducers
cites work: Q4385527
cites work: Economy of description for single-valued transducers
description: scientific article; zbMATH DE number 1281079