The loop complexity of pure-group events

Cited in

(25)

Algorithms for determining relative star height and star height
Algorithms for determining relative inclusion star height and inclusion star height
Walkwise and admissible mappings between digraphs
Inversion height in free fields
Descriptional complexity of regular languages
State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
Regularity conditions for iterated shuffle on commutative regular languages
General properties of star height of regular events
Star height of certain families of regular events
Components and acyclicity of graphs. An exercise in combining precision with concision
From finite automata to regular expressions and back -- a summary on descriptional complexity
The complexity of regular(-like) expressions
Finite Automata, Digraph Connectivity, and Regular Expression Size
ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA
Tight Bounds on the Descriptional Complexity of Regular Expressions
scientific article; zbMATH DE number 3293675 (Why is no real title available?)
Techniques for establishing star height of regular sets
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
Bideterministic weighted automata
On the undecidability and descriptional complexity of synchronized regular expressions
Bideterministic weighted automata
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
The solutions of two star-height problems for regular trees
State complexity of projection on languages recognized by permutation automata and commuting letters
Succinctness of regular expressions with interleaving, intersection and counting

This page was built for publication: The loop complexity of pure-group events

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5551181)