Pages that link to "Item:Q2830201"
From MaRDI portal
The following pages link to Implementation and Application of Automata (Q2830201):
Displayed 50 items.
- Decision Problems for Finite Automata over Infinite Algebraic Structures (Q2830202) (← links)
- The Degree of Irreversibility in Deterministic Finite Automata (Q2830203) (← links)
- Deterministic Stack Transducers (Q2830204) (← links)
- Computing the Expected Edit Distance from a String to a PFA (Q2830206) (← links)
- Derived-Term Automata of Multitape Rational Expressions (Q2830207) (← links)
- Solving Parity Games Using an Automata-Based Algorithm (Q2830208) (← links)
- Ternary Equational Languages (Q2830209) (← links)
- Problems on Finite Automata and the Exponential Time Hypothesis (Q2830210) (← links)
- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (Q2830211) (← links)
- A Practical Simulation Result for Two-Way Pushdown Automata (Q2830212) (← links)
- Nondeterministic Complexity of Operations on Closed and Ideal Languages (Q2830213) (← links)
- On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L (Q2830214) (← links)
- Kuratowski Algebras Generated by Prefix-Free Languages (Q2830215) (← links)
- A Logical Characterization of Small 2NFAs (Q2830217) (← links)
- Experiments with Synchronizing Automata (Q2830218) (← links)
- Implementation of Code Properties via Transducers (Q2830220) (← links)
- On Synchronizing Automata and Uniform Distribution (Q2830221) (← links)
- Looking for Pairs that Hard to Separate: A Quantum Approach (Q2830222) (← links)
- Prefix Distance Between Regular Languages (Q2830223) (← links)
- Complexity of Sets of Two-Dimensional Patterns (Q2830224) (← links)
- The Complexity of Fixed-Height Patterned Tile Self-assembly (Q2830225) (← links)
- Derivative-Based Diagnosis of Regular Expression Ambiguity (Q2830226) (← links)
- Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages (Q2830227) (← links)
- Derivatives for Enhanced Regular Expressions (Q2830228) (← links)
- Weighted Restarting Automata as Language Acceptors (Q2830229) (← links)
- Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy (Q2830232) (← links)
- Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA (Q2830233) (← links)
- In Memoriam Sheng Yu (Q2914689) (← links)
- In Search of Most Complex Regular Languages (Q2914690) (← links)
- A Formal Framework for Processes Inspired by the Functioning of Living Cells (Q2914691) (← links)
- Adding Pebbles to Weighted Automata (Q2914692) (← links)
- Typed Linear Algebra for Weigthed (Probabilistic) Automata (Q2914693) (← links)
- A Pushdown Transducer Extension for the OpenFst Library (Q2914694) (← links)
- Weak Inclusion for Recursive XML Types (Q2914696) (← links)
- Synchronizing Automata on Quasi-Eulerian Digraph (Q2914697) (← links)
- Cellular Automata on Regular Rooted Trees (Q2914698) (← links)
- Strict Local Testability with Consensus Equals Regularity (Q2914699) (← links)
- Nominal Automata for Resource Usage Control (Q2914700) (← links)
- Weighted Nested Word Automata and Logics over Strong Bimonoids (Q2914701) (← links)
- A Fast Suffix Automata Based Algorithm for Exact Online String Matching (Q2914702) (← links)
- P(l)aying for Synchronization (Q2914704) (← links)
- Synchronizing Automata of Bounded Rank (Q2914705) (← links)
- Automatic Theorem-Proving in Combinatorics on Words (Q2914707) (← links)
- How to Synchronize the Heads of a Multitape Automaton (Q2914708) (← links)
- Regular Ideal Languages and Their Boolean Combinations (Q2914710) (← links)
- Hyper-minimization for Deterministic Tree Automata (Q2914711) (← links)
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (Q2914712) (← links)
- Implementing Computations in Automaton (Semi)groups (Q2914713) (← links)
- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (Q2914714) (← links)
- A Disambiguation Algorithm for Finite Automata and Functional Transducers (Q2914715) (← links)