Pages that link to "Item:Q5313718"

The following pages link to Distance desert automata and the star height problem (Q5313718):

Displaying 22 items.

• Approximate comparison of functions computed by distance automata (Q290904) (← links)
• Weak MSO with the unbounding quantifier (Q537919) (← links)
• Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring (Q764364) (← links)
• Closure properties and complexity of rational sets of regular languages (Q888431) (← links)
• Bounded regular path queries in view-based data integration (Q989472) (← links)
• Automata and rational expressions (Q2074204) (← links)
• Weighted automata (Q2074206) (← links)
• Generic results for concatenation hierarchies (Q2311891) (← links)
• Stamina: stabilisation monoids in automata theory (Q2399252) (← links)
• Concatenation hierarchies: new bottle, old wine (Q2399361) (← links)
• Trading Bounds for Memory in Games with Counters (Q3449476) (← links)
• The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (Q3519517) (← links)
• Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
• A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (Q3526417) (← links)
• The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (Q3540194) (← links)
• R-Automata (Q3541011) (← links)
• Factorization Forests (Q3637210) (← links)
• (Q4858461) (← links)
• Limited Non-determinism Hierarchy of Counter Automata (Q4910447) (← links)
• (Q5028432) (← links)
• Universality of R-automata with Value Copying (Q5179055) (← links)
• Resynchronized uniformization and definability problems for rational relations (Q6599794) (← links)