Distance desert automata and the star height problem
From MaRDI portal
Publication:5313718
Recommendations
- Foundations of Software Science and Computation Structures
- Distance desert automata and star height substitutions.
- scientific article; zbMATH DE number 826075
- STACS 2004
- Some Variants of the Star Height Problem
- On the height of a finite automaton
- Some results on the generalized star-height problem
- On the complexity of the relative inclusion star height problem
- scientific article; zbMATH DE number 2086220
- The limitedness problem on distance automata: Hashiguchi's method revisited
Cites work
- A Burnside approach to the finite substitution problem
- Algorithms for determining relative star height and star height
- Distance automata having large finite distance or finite ambiguity
- Finite-valued distance automata
- Foundations of Software Science and Computation Structures
- Homomorphisms that preserve star height
- scientific article; zbMATH DE number 2086220 (Why is no real title available?)
- scientific article; zbMATH DE number 988805 (Why is no real title available?)
- scientific article; zbMATH DE number 4218075 (Why is no real title available?)
- scientific article; zbMATH DE number 4070361 (Why is no real title available?)
- scientific article; zbMATH DE number 4072419 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 18901 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 459363 (Why is no real title available?)
- scientific article; zbMATH DE number 1142311 (Why is no real title available?)
- scientific article; zbMATH DE number 1163636 (Why is no real title available?)
- scientific article; zbMATH DE number 1163639 (Why is no real title available?)
- scientific article; zbMATH DE number 2102758 (Why is no real title available?)
- Improved limitedness theorems on finite automata with distance functions
- Limitedness theorem on finite automata with distance functions
- Limitedness theorem on finite automata with distance functions: An algebraic proof
- New results on the star problem in trace monoids
- New upper bounds to the limitedness of distance automata
- On a question of Eggan
- On finite automata with limited nondeterminism
- On semigroups of matrices over the tropical semiring
- ON THE STAR HEIGHT OF RATIONAL LANGUAGES
- On the topological structure of a finitely generated semigroup of matrices
- Parametrized recurrent systems for image generation
- Regular languages of star height one
- Representation theorems on regular languages
- STACS 2004
- STACS 2004
- Star height of certain families of regular events
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- The limitedness problem on distance automata: Hashiguchi's method revisited
- Transition graphs and the star-height of regular events
- Two techniques in the area of the star problem in trace monoids
Cited in
(32)- Some results on the generalized star-height problem
- Automata and rational expressions
- Weighted automata
- Generic results for concatenation hierarchies
- Stamina: stabilisation monoids in automata theory
- Concatenation hierarchies: new bottle, old wine
- Approximate comparison of functions computed by distance automata
- scientific article; zbMATH DE number 2086220 (Why is no real title available?)
- Distance desert automata and star height substitutions.
- Trading bounds for memory in games with counters
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
- R-Automata
- Factorization Forests
- scientific article; zbMATH DE number 1234586 (Why is no real title available?)
- ON THE STAR HEIGHT OF RATIONAL LANGUAGES
- Star height via games
- Open problems about regular languages, 35 years later
- scientific article; zbMATH DE number 826075 (Why is no real title available?)
- Limited non-determinism hierarchy of counter automata
- Controlling a random population
- Universality of R-automata with Value Copying
- Foundations of Software Science and Computation Structures
- Weak MSO with the unbounding quantifier
- Digraph complexity measures and applications in formal language theory
- Resynchronized uniformization and definability problems for rational relations
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
- An application of Cohen's result on star height to the theory of control structures
- Closure properties and complexity of rational sets of regular languages
- Bounded regular path queries in view-based data integration
This page was built for publication: Distance desert automata and the star height problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5313718)
