The loop complexity of pure-group events
From MaRDI portal
Publication:5551181
DOI10.1016/S0019-9958(67)90481-0zbMath0166.26905WikidataQ55885175 ScholiaQ55885175MaRDI QIDQ5551181
Publication date: 1967
Published in: Information and Control (Search for Journal in Brave)
Related Items
State complexity of projection on languages recognized by permutation automata and commuting letters, THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS, Algorithms for determining relative star height and star height, Inversion height in free fields, Techniques for establishing star height of regular sets, Components and acyclicity of graphs. An exercise in combining precision with concision, Regularity Conditions for Iterated Shuffle on Commutative Regular Languages, Bideterministic weighted automata, Bideterministic weighted automata, On the undecidability and descriptional complexity of synchronized regular expressions, Finite Automata, Digraph Connectivity, and Regular Expression Size, ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA, Unnamed Item, Algorithms for determining relative inclusion star height and inclusion star height, Succinctness of regular expressions with interleaving, intersection and counting, From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity, Tight Bounds on the Descriptional Complexity of Regular Expressions, The solutions of two star-height problems for regular trees, General properties of star height of regular events, Star height of certain families of regular events, Descriptional complexity of regular languages, Walkwise and admissible mappings between digraphs, 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
