A linear time solution to the single function coarsest partition problem
From MaRDI portal
See the review of the preliminary version [Lect. Notes Comput. Sci. 172, 371-379 (1984; Zbl 0554.68045)].
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- Automatic data structure choice in a language of very high level
- Experience with the SETL Optimizer
- Fast canonization of circular strings
- Fast Decision Procedures Based on Congruence Closure
- Fast Pattern Matching in Strings
- Finite Differencing of Computable Expressions
- scientific article; zbMATH DE number 3883625 (Why is no real title available?)
- scientific article; zbMATH DE number 3872663 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 3481857 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Lexicographically least circular substrings
- Linear Automaton Transformations
- Satins and Twills: An Introduction to the Geometry of Fabrics
- The Invalidity of Markoff's Schema
- The promotion and accumulation strategies in transformational programming
- Variations on the Common Subexpression Problem
Cited in
(29)- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
- Optimal canonization of all substrings of a string
- The parallel complexity of coarsest set partition problems
- A derived algorithm for evaluating -expressions over abstract sets
- An efficient parallel algorithm for the single function coarsest partition problem
- Generalizations of suffix arrays to multi-dimensional matrices.
- Sorting and doubling techniques for set partitioning and automata minimization problems
- Re-describing an algorithm by Hopcroft
- Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
- An efficient algorithm for computing bisimulation equivalence
- On extremal cases of Hopcroft's algorithm
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
- Tight lower and upper bounds for the complexity of canonical colour refinement
- An efficient fully symbolic bisimulation algorithm for non-deterministic systems
- Hopcroft's algorithm and tree-like automata
- Computing the Maximum Bisimulation with Spiking Neural P Systems
- An efficient algorithm for a special case of the set partition problem
- Hopcroft’s Minimization Technique: Queues or Stacks?
- On Extremal Cases of Hopcroft’s Algorithm
- Fast parallel Lyndon factorization with applications
- Rank-based symbolic bisimulation: (and model checking)
- Standard Sturmian words and automata minimization algorithms
- An Incremental Bisimulation Algorithm
- Generalizations of suffix arrays to multi-dimensional matrices.
- Lowerbounds for Bisimulation by Partition Refinement
- Using multiset discrimination to solve language processing problems without hashing
- A theory of ultimately periodic languages and automata with an application to time granularity
- Transformational derivation of an improved alias analysis algorithm
- An NSF proposal
This page was built for publication: A linear time solution to the single function coarsest partition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1063420)