Pages that link to "Item:Q3602794"
From MaRDI portal
The following pages link to Implementation and Applications of Automata (Q3602794):
Displaying 30 items.
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Language Decompositions, Primality, and Trajectory-Based Operations (Q3602796) (← links)
- Automata, Probability, and Recursion (Q3602797) (← links)
- Concurrency, Synchronization, and Conflicts in Petri Nets (Q3602798) (← links)
- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties (Q3602799) (← links)
- Antimirov and Mosses’s Rewrite System Revisited (Q3602800) (← links)
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata (Q3602801) (← links)
- Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (Q3602802) (← links)
- Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
- Learning Regular Languages Using Nondeterministic Finite Automata (Q3602804) (← links)
- Multi-Return Macro Tree Transducers (Q3602805) (← links)
- Computing Convex Hulls by Automata Iteration (Q3602806) (← links)
- A Translation from the HTML DTD into a Regular Hedge Grammar (Q3602807) (← links)
- Tree-Series-to-Tree-Series Transformations (Q3602808) (← links)
- Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning (Q3602809) (← links)
- Pattern Matching in DCA Coded Text (Q3602810) (← links)
- Five Determinisation Algorithms (Q3602811) (← links)
- Persistent Computations of Turing Machines (Q3602812) (← links)
- On Complexity of Two Dimensional Languages Generated by Transducers (Q3602813) (← links)
- Games for Temporal Logics on Trees (Q3602814) (← links)
- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (Q3602815) (← links)
- Composed Bisimulation for Tree Automata (Q3602816) (← links)
- Hyper-Minimization in O(n 2) (Q3602817) (← links)
- Deterministic Pushdown Automata and Unary Languages (Q3602818) (← links)
- Finite Eilenberg Machines (Q3602819) (← links)
- The Number of Runs in Sturmian Words (Q3602820) (← links)
- 3-Way Composition of Weighted Finite-State Transducers (Q3602821) (← links)
- Progressive Solutions to FSM Equations (Q3602822) (← links)
- Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees (Q3602823) (← links)
- Approximate Periods with Levenshtein Distance (Q3602824) (← links)
