scientific article
From MaRDI portal
Publication:4045961
zbMATH Open0293.94022MaRDI QIDQ4045961FDOQ4045961
Publication date: 1974
Title of this publication is not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Title not available (Why is that?)
- State complexity of projection on languages recognized by permutation automata and commuting letters
- Deciding determinism of regular languages
- An algorithm to compute the character access count distribution for pattern matching algorithms
- Generalizations of suffix arrays to multi-dimensional matrices.
- Efficient minimization of deterministic weak \(\omega\)-automata
- Using multiset discrimination to solve language processing problems without hashing
- A graph theoretic approach to automata minimality
- Deciding Monadic Second Order Logic over $$\omega $$ ω -Words by Specialized Finite Automata
- Distribution of Clump Statistics for a Collection of Words
- Minimizing Deterministic Weighted Tree Automata
- Random Deterministic Automata
- Minimizing finite automata is computationally hard
- Enumeration and generation with a string automata representation
- Circular Sturmian words and Hopcroft's algorithm
- Fast brief practical DFA minimization
- NFA reduction algorithms by means of regular inequalities
- On the Hopcroft's minimization technique for DFA and DFCA
- From generic partition refinement to weighted tree automata minimization
- Backward and forward bisimulation minimization of tree automata
- The parallel complexity of finite-state automata problems
- Efficient minimization of homogeneous FSMs for fault diagnosis
- Obtaining shorter regular expressions from finite-state automata
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- CCS expressions, finite state processes, and three problems of equivalence
- Second-order finite automata
- Extremal minimality conditions on automata
- An algorithmic view of gene teams
- Re-describing an algorithm by Hopcroft
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations
- An Algebraic Characterization of Strictly Piecewise Languages
- Optimal state-space lumping in Markov chains
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
- Linear temporal logic -- from infinite to finite horizon
- The suffix tree of a tree and minimizing sequential transducers
- Partitioning a graph in \(O(|A|\log_ 2|V|)\)
- A survey of the algorithmic aspects of modular decomposition
- Subsequential transducers: a coalgebraic perspective
- The state complexity of random DFAs
- The word problem for \(\omega \)-terms over DA
- Construction of minimal deterministic finite automata from biological motifs
- In and out of equilibrium. I: Evolution of strategies in repeated games with discounting.
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
- Minimizing deterministic weighted tree automata
- Effective reductions of Mealy machines
- Canonical finite state machines for distributed systems
- Cycle-aware minimization of acyclic deterministic finite-state automata
- Standard Sturmian words and automata minimization algorithms
- Generalizations of suffix arrays to multi-dimensional matrices.
- Graph fibrations, graph isomorphism, and PageRank
- Hyper-minimizing minimized deterministic finite state automata
- Simulation relations and applications in formal methods
- A linear time solution to the single function coarsest partition problem
- Second-Order Finite Automata
- Five Determinisation Algorithms
- Title not available (Why is that?)
- Follow automata.
- Hopcroft's algorithm and tree-like automata
- Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
- Identification of function distinguishable languages.
- On bisimulations for description logics
- An Incremental Bisimulation Algorithm
- Incremental NFA minimization
- Cellular Automata: Descriptional Complexity and Decidability
- \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs
- Title not available (Why is that?)
- Tight lower and upper bounds for the complexity of canonical colour refinement
- Quantum algorithm for lexicographically minimal string rotation
- Algorithms for minimization of finite acyclic automata and pattern matching in terms
- Coalgebraic minimization of automata by initiality and finality
- Lowerbounds for Bisimulation by Partition Refinement
- Hyper-optimization for deterministic tree automata
- Minimization of Visibly Pushdown Automata Using Partial Max-SAT
- Morphisms and Minimisation of Weighted Automata
- Computation of exact probabilities associated with overlapping pattern occurrences
- Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference
- Ostrowski-automatic sequences: theory and applications
- Isomorphism Test for Digraphs with Weighted Edges.
- Fault tolerance in distributed systems using fused state machines
- On the Simon's congruence neighborhood of languages
- Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification
- Minimizing GFG Transition-Based Automata
- On the metric-based approximate minimization of Markov chains
- Sofic Shifts via Conley Index Theory: Computing Lower Bounds on Recurrent Dynamics for Maps
- Forward Bisimulations for Nondeterministic Symbolic Finite Automata
- Minimality Notions via Factorization Systems and Examples
- A congruence-based perspective on automata minimization algorithms
- An O(m log n) algorithm for branching bisimilarity on labelled transition systems
- Reasoning About Regular Properties: A Comparative Study
- Self-similar sets and self-similar measures in the \(p\)-adics
- Automata Learning: A Categorical Perspective
- New Optimizations and Heuristics for Determinization of Büchi Automata
- Fast algorithms for identifying maximal common connected sets of interval graphs
- Distribution of statistics of hidden state sequences through the sum-product algorithm
- Computing the fuzzy partition corresponding to the greatest fuzzy auto-bisimulation of a fuzzy graph-based structure under the Gödel semantics
- Effective subdirect decomposition: A case study
- Efficient simplicity testing of automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4045961)
