Some properties of recognizable L-subsets

Authors:
Nami Kobayashi
Affiliations:
Departamento de Ciência da Computação, Instituto de Matemática e Estatística, Universidade de São Paulo, Rua do Matão, 1010, 05508-090 São Paulo, Brazil
Venue:
Theoretical Computer Science
Year:
2003

Citing 8
Cited 0

Algorithms for determining relative star height and star height

Information and Computation
Improved limitedness theorems on finite automata with distance functions

Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Factorization forests of finite height

Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Limitedness theorem on finite automata with distance functions: an algebraic proof

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Recognizable Sets with Multiplicities in the Tropical Semiring

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Properties of Recognizable M-Subsets of a Free Monoid

LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Computations with a restricted number of nondeterministic steps (Extended Abstract)

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

For the two-sided homogeneous linear equation system A ⊗ x = B ⊗ y over (max, +), with no infinite rows or columns in A or B, an algorithm is presented which converges to a finite solution from any finite starting point ...