Transition graphs and the star-height of regular events
From MaRDI portal
Publication:2531871
Cited in
(57)- Classifying regular languages by a split game
- Representation theorems on regular languages
- Algorithms for determining relative star height and star height
- Remark on the star-height-problem
- Classifying regular events in symbolic logic
- Algorithms for determining relative inclusion star height and inclusion star height
- A neural network which computes the square root
- Nonnegative companion matrices and star-height of \(\mathbb{N}\)-rational series
- Towards fixed-parameter tractable algorithms for abstract argumentation
- On depth in EDTOL languages
- Inversion height in free fields
- Entanglement and the complexity of directed graphs
- Automata and rational expressions
- Descriptional complexity of regular languages
- How to compute digraph width measures on directed co-graphs
- Generic results for concatenation hierarchies
- Complexity of node coverage games
- Characterization and complexity results on jumping finite automata
- Concatenation-free languages
- The chop of languages
- Stamina: stabilisation monoids in automata theory
- Concatenation hierarchies: new bottle, old wine
- Digraph width measures in parameterized algorithmics
- Substitution expressions
- General properties of star height of regular events
- Star height of certain families of regular events
- Unification and combination of a class of traversal strategies made with pattern matching and fixed-points
- From finite automata to regular expressions and back -- a summary on descriptional complexity
- Jumping finite automata: characterizations and complexity
- LIFO-search on digraphs: a searching game for cycle-rank
- On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
- Applicability conditions for plans with loops: computability results and algorithms
- Factorization Forests
- Tight Bounds on the Descriptional Complexity of Regular Expressions
- Short Regular Expressions from Finite Automata: Empirical Results
- On digraph width measures in parameterized algorithmics
- On the algorithmic effectiveness of digraph decompositions and complexity measures
- Federation and navigation in SPARQL 1.1
- Provably shorter regular expressions from finite automata
- Distance desert automata and the star height problem
- scientific article; zbMATH DE number 3293675 (Why is no real title available?)
- Techniques for establishing star height of regular sets
- Hierarchical decompositions and termination analysis for generalized planning
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Theoretical computer science: computational complexity
- Self-consistent field theory for loop-containing polymers: a general algorithm for path-determination
- Games for succinctness of regular expressions
- Co-lexicographically ordering automata and regular languages. I
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
- The solutions of two star-height problems for regular trees
- On the ratio of growth functions in EDTOL languages
- An application of Cohen's result on star height to the theory of control structures
- On low tree-depth decompositions
- Infinite hierarchy of shuffle expressions over a finite alphabet
- Succinctness of regular expressions with interleaving, intersection and counting
This page was built for publication: Transition graphs and the star-height of regular events
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2531871)
