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