Pages that link to "Item:Q2531871"

The following pages link to Transition graphs and the star-height of regular events (Q2531871):

Displaying 50 items.

• On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups (Q329726) (← links)
• Applicability conditions for plans with loops: computability results and algorithms (Q359973) (← links)
• On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
• Complexity of semi-stable and stage semantics in argumentation frameworks (Q656597) (← links)
• LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
• The solutions of two star-height problems for regular trees (Q760212) (← links)
• On the ratio of growth functions in EDTOL languages (Q797295) (← links)
• An application of Cohen's result on star height to the theory of control structures (Q799363) (← links)
• On low tree-depth decompositions (Q897253) (← links)
• Infinite hierarchy of shuffle expressions over a finite alphabet (Q918713) (← links)
• Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
• Classifying regular languages by a split game (Q1022599) (← links)
• Representation theorems on regular languages (Q1052828) (← links)
• Algorithms for determining relative star height and star height (Q1118420) (← links)
• Remark on the star-height-problem (Q1149251) (← links)
• Classifying regular events in symbolic logic (Q1173413) (← links)
• Algorithms for determining relative inclusion star height and inclusion star height (Q1183589) (← links)
• A neural network which computes the square root (Q1262773) (← links)
• Nonnegative companion matrices and star-height of \(\mathbb{N}\)-rational series (Q1390858) (← links)
• Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
• On depth in EDTOL languages (Q1836481) (← links)
• Inversion height in free fields (Q1919132) (← links)
• Entanglement and the complexity of directed graphs (Q1929212) (← links)
• Automata and rational expressions (Q2074204) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
• Generic results for concatenation hierarchies (Q2311891) (← links)
• Complexity of node coverage games (Q2344734) (← links)
• Characterization and complexity results on jumping finite automata (Q2357104) (← links)
• Concatenation-free languages (Q2357107) (← links)
• The chop of languages (Q2358686) (← links)
• Stamina: stabilisation monoids in automata theory (Q2399252) (← links)
• Concatenation hierarchies: new bottle, old wine (Q2399361) (← links)
• Digraph width measures in parameterized algorithmics (Q2442211) (← links)
• Substitution expressions (Q2550293) (← links)
• General properties of star height of regular events (Q2555471) (← links)
• Star height of certain families of regular events (Q2555472) (← links)
• Unification and combination of a class of traversal strategies made with pattern matching and fixed-points (Q2669251) (← links)
• From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
• Jumping Finite Automata: Characterizations and Complexity (Q2947412) (← links)
• LIFO-Search on Digraphs: A Searching Game for Cycle-Rank (Q3088285) (← links)
• Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← 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)
• Short Regular Expressions from Finite Automata: Empirical Results (Q3637356) (← links)
• On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
• Federation and Navigation in SPARQL 1.1 (Q4647814) (← links)
• PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (Q5168416) (← links)
• Distance desert automata and the star height problem (Q5313718) (← links)