Distance automata having large finite distance or finite ambiguity
From MaRDI portal
Publication:4032930
DOI10.1007/BF01202281zbMath0771.68088MaRDI QIDQ4032930
No author found.
Publication date: 17 May 1993
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Related Items
Finite-valued distance automata ⋮ Exponential upper and lower bounds for the order of a regular language ⋮ Distance desert automata and the star height problem ⋮ A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata ⋮ Limited Non-determinism Hierarchy of Counter Automata ⋮ Bounded regular path queries in view-based data integration ⋮ New upper bounds to the limitedness of distance automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limitedness theorem on finite automata with distance functions: An algebraic proof
- Improved limitedness theorems on finite automata with distance functions
- On measuring nondeterminism in regular languages
- Limitedness theorem on finite automata with distance functions
- Representation theorems on regular languages
- Algorithms for determining relative star height and star height
- A decision procedure for the order of regular events
- Amounts of nondeterminism in finite automata
- On the degree of ambiguity of finite automata
- On the relation between ambiguity and nondeterminism in finite automata
- Finite automata having cost functions: Nondeterministic models
- On finitely generated monoids of matrices with entries in $\mathbb {N}$
