Some properties of recognizable \(\mathcal Z\)-subsets
type: Item
instance of: scholarly article
title: Some properties of recognizable \(\mathcal Z\)-subsets
zbMATH Open document ID: 1026.68080
DOI: 10.1016/S0304-3975(02)00233-5
author: Nami Kobayashi
published in: Theoretical Computer Science
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1909924
zbMATH Keywords: nondeterministic complexities of finite automata
MaRDI profile type: Publication
cites work: Q3859267
cites work: Q3691074
cites work: Minimax algebra
cites work: Q4079524
cites work: On the relation between ambiguity and nondeterminism in finite automata
cites work: A decision procedure for the order of regular events
cites work: Limitedness theorem on finite automata with distance functions
cites work: Algorithms for determining relative star height and star height
cites work: Improved limitedness theorems on finite automata with distance functions
cites work: Amounts of nondeterminism in finite automata
cites work: The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets
cites work: THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
cites work: Some consequences of a Fatou property of the tropical semiring
cites work: Limitedness theorem on finite automata with distance functions: An algebraic proof
cites work: Q4395212
cites work: On the definition of a family of automata
cites work: On a Theorem of R. Jungen
cites work: Q5626549
cites work: Q3804221
cites work: Factorization forests of finite height
cites work: On semigroups of matrices over the tropical semiring
description: scientific article; zbMATH DE number 1909924