Pages that link to "Item:Q1118420"

The following pages link to Algorithms for determining relative star height and star height (Q1118420):

Displaying 43 items.

• Weak MSO with the unbounding quantifier (Q537919) (← links)
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton (Q703577) (← links)
• Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring (Q764364) (← links)
• Factorization forests for infinite words and applications to countable scattered linear orderings (Q846364) (← links)
• Classifying regular languages by a split game (Q1022599) (← links)
• Polynomial operations and hierarchies of concatenation (Q1183588) (← links)
• Algorithms for determining relative inclusion star height and inclusion star height (Q1183589) (← links)
• Periodic sets of integers (Q1342238) (← links)
• Monadic logic programs and functional complexity (Q1392280) (← links)
• On transformations of formal power series. (Q1401954) (← links)
• New upper bounds to the limitedness of distance automata (Q1575957) (← links)
• Some properties of recognizable \(\mathcal Z\)-subsets (Q1870588) (← links)
• Equational theories of tropical semirings (Q1874279) (← links)
• The limitedness problem on distance automata: Hashiguchi's method revisited (Q1884970) (← links)
• Inversion height in free fields (Q1919132) (← links)
• Finite sequentiality of unambiguous max-plus tree automata (Q2048206) (← links)
• Automata and rational expressions (Q2074204) (← links)
• Max-plus automata (Q2074207) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• Operational union-complexity (Q2113386) (← links)
• Generic results for concatenation hierarchies (Q2311891) (← links)
• Characterization and complexity results on jumping finite automata (Q2357104) (← links)
• Multiheuristic approach to discrete optimization problems (Q2371698) (← links)
• Stamina: stabilisation monoids in automata theory (Q2399252) (← links)
• Concatenation hierarchies: new bottle, old wine (Q2399361) (← links)
• On the power of circular splicing (Q2565850) (← links)
• From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
• THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (Q2909093) (← links)
• Jumping Finite Automata: Characterizations and Complexity (Q2947412) (← 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)
• Factorization Forests (Q3637210) (← links)
• Tight Bounds on the Descriptional Complexity of Regular Expressions (Q3637232) (← links)
• Distance automata having large finite distance or finite ambiguity (Q4032930) (← 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)
• (Q5090506) (← links)
• (Q5111268) (← links)
• Distance desert automata and the star height problem (Q5313718) (← links)
• Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata (Q6154973) (← links)