Pages that link to "Item:Q1050772"

The following pages link to Limitedness theorem on finite automata with distance functions (Q1050772):

Displaying 48 items.

• Approximate comparison of functions computed by distance automata (Q290904) (← links)
• Limitedness theorem on finite automata with distance functions: An algebraic proof (Q807031) (← links)
• Fuzzy \(h\)-ideals of hemirings. (Q867654) (← links)
• Closure properties and complexity of rational sets of regular languages (Q888431) (← links)
• Improved limitedness theorems on finite automata with distance functions (Q908702) (← links)
• Factorization forests of finite height (Q908712) (← links)
• On measuring nondeterminism in regular languages (Q912641) (← links)
• Bounded regular path queries in view-based data integration (Q989472) (← links)
• Representation theorems on regular languages (Q1052828) (← links)
• On the topological structure of a finitely generated semigroup of matrices (Q1103733) (← links)
• Algorithms for determining relative star height and star height (Q1118420) (← links)
• Polynomial operations and hierarchies of concatenation (Q1183588) (← links)
• Algorithms for determining relative inclusion star height and inclusion star height (Q1183589) (← links)
• Rational relations and rational series (Q1194313) (← links)
• Some consequences of a Fatou property of the tropical semiring (Q1326758) (← links)
• A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring (Q1341738) (← links)
• Finite-valued distance automata (Q1341750) (← links)
• Exponential upper and lower bounds for the order of a regular language (Q1341751) (← links)
• New upper bounds to the limitedness of distance automata (Q1575957) (← links)
• Distances between languages and reflexivity of relations (Q1608895) (← links)
• The finite power problem revisited. (Q1853154) (← links)
• The finite power property in free groups (Q1870586) (← links)
• Some properties of recognizable \(\mathcal Z\)-subsets (Q1870588) (← links)
• Equational theories of tropical semirings (Q1874279) (← links)
• Two techniques in the area of the star problem in trace monoids (Q1884907) (← links)
• The limitedness problem on distance automata: Hashiguchi's method revisited (Q1884970) (← links)
• On the Burnside problem for semigroups of matrices in the \((\max,+)\) algebra (Q1914078) (← links)
• What's decidable about weighted automata? (Q2064522) (← links)
• The factorisation forest theorem (Q2074219) (← links)
• Sequential? (Q2490822) (← links)
• Regular path queries under approximate semantics (Q2502162) (← links)
• On the power of circular splicing (Q2565850) (← links)
• R-Automata (Q3541011) (← links)
• Factorization Forests (Q3637210) (← links)
• (Q3700841) (← links)
• Distance automata having large finite distance or finite ambiguity (Q4032930) (← links)
• On semigroups of matrices over the tropical semiring (Q4365014) (← links)
• The product of rational languages (Q4630281) (← links)
• The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets (Q4717041) (← links)
• DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA (Q4786328) (← links)
• (Q5091266) (← links)
• On finite automata with limited nondeterminism (extended abstract) (Q5096848) (← links)
• Universality of R-automata with Value Copying (Q5179055) (← links)
• SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS (Q5247179) (← links)
• Distance desert automata and the star height problem (Q5313718) (← links)
• MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES (Q5483370) (← links)
• REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS (Q5483458) (← links)
• Weak Cost Register Automata are Still Powerful (Q5859644) (← links)