Pages that link to "Item:Q5551181"
From MaRDI portal
The following pages link to The loop complexity of pure-group events (Q5551181):
Displaying 25 items.
- The solutions of two star-height problems for regular trees (Q760212) (← links)
- State complexity of projection on languages recognized by permutation automata and commuting letters (Q832938) (← links)
- Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
- Algorithms for determining relative star height and star height (Q1118420) (← links)
- Algorithms for determining relative inclusion star height and inclusion star height (Q1183589) (← links)
- Walkwise and admissible mappings between digraphs (Q1845747) (← links)
- Inversion height in free fields (Q1919132) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages (Q2096584) (← links)
- Regularity conditions for iterated shuffle on commutative regular languages (Q2117658) (← links)
- General properties of star height of regular events (Q2555471) (← links)
- Star height of certain families of regular events (Q2555472) (← links)
- Components and acyclicity of graphs. An exercise in combining precision with concision (Q2667191) (← links)
- From finite automata to regular expressions and back -- a summary on descriptional complexity (Q2800411) (← links)
- The complexity of regular(-like) expressions (Q2909093) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA (Q3538856) (← links)
- Tight Bounds on the Descriptional Complexity of Regular Expressions (Q3637232) (← links)
- (Q5576262) (← links)
- Techniques for establishing star height of regular sets (Q5623619) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
- Bideterministic weighted automata (Q6108730) (← links)
- On the undecidability and descriptional complexity of synchronized regular expressions (Q6171822) (← links)
- Bideterministic weighted automata (Q6186321) (← links)
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages (Q6647746) (← links)