Pages that link to "Item:Q2830201"
From MaRDI portal
The following pages link to Implementation and Application of Automata (Q2830201):
Displayed 50 items.
- The Cayley-Hamilton Theorem for Noncommutative Semirings (Q3073632) (← links)
- Approximating Minimum Reset Sequences (Q3073634) (← links)
- Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata (Q3073635) (← links)
- Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization (Q3073636) (← links)
- Partially Ordered Two-Way Büchi Automata (Q3073637) (← links)
- Two-Party Watson-Crick Computations (Q3073638) (← links)
- Better Hyper-minimization (Q3073639) (← links)
- Regular Expressions on Average and in the Long Run (Q3073640) (← links)
- Reachability Games on Automatic Graphs (Q3073641) (← links)
- Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions (Q3073642) (← links)
- A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (Q3073643) (← links)
- A Challenging Family of Automata for Classical Minimization Algorithms (Q3073644) (← links)
- State of Büchi Complementation (Q3073645) (← links)
- Types of Trusted Information That Make DFA Identification with Correction Queries Feasible (Q3073646) (← links)
- Compressing Regular Expressions’ DFA Table by Matrix Decomposition (Q3073647) (← links)
- Relational String Verification Using Multi-track Automata (Q3073648) (← links)
- A Note on a Tree-Based 2D Indexing (Q3073649) (← links)
- Regular Expressions at Their Best: A Case for Rational Design (Q3073651) (← links)
- Simulations of Weighted Tree Automata (Q3073652) (← links)
- FPsolve: A Generic Solver for Fixpoint Equations over Semirings (Q3192248) (← links)
- Restarting Automata for Picture Languages: A Survey on Recent Developments (Q3192249) (← links)
- Investigations on Automata and Languages over a Unary Alphabet (Q3192250) (← links)
- Cellular Automata for Crowd Dynamics (Q3192251) (← links)
- Counting Equivalent Linear Finite Transducers Using a Canonical Form (Q3192252) (← links)
- On the Power of One-Way Automata with Quantum and Classical States (Q3192253) (← links)
- On Comparing Deterministic Finite Automata and the Shuffle of Words (Q3192254) (← links)
- Minimal Partial Languages and Automata (Q3192256) (← links)
- Large Aperiodic Semigroups (Q3192257) (← links)
- On the Square of Regular Languages (Q3192258) (← links)
- Unary Languages Recognized by Two-Way One-Counter Automata (Q3192259) (← links)
- A Type System for Weighted Automata and Rational Expressions (Q3192261) (← links)
- Bounded Prefix-Suffix Duplication (Q3192263) (← links)
- Recognition of Labeled Multidigraphs by Spanning Tree Automata (Q3192264) (← links)
- Reset Thresholds of Automata with Two Cycle Lengths (Q3192265) (← links)
- On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers (Q3192266) (← links)
- Kleene Closure on Regular and Prefix-Free Languages (Q3192267) (← links)
- Left is Better than Right for Reducing Nondeterminism of NFAs (Q3192268) (← links)
- Analytic Functions Computable by Finite State Transducers (Q3192269) (← links)
- Partial Derivative and Position Bisimilarity Automata (Q3192270) (← links)
- The Power of Regularity-Preserving Multi Bottom-up Tree Transducers (Q3192271) (← links)
- Pushdown Machines for Weighted Context-Free Tree Translation (Q3192272) (← links)
- Weighted Variable Automata over Infinite Alphabets (Q3192274) (← links)
- Implications of Quantum Automata for Contextuality (Q3192275) (← links)
- Pairwise Rational Kernels Obtained by Automaton Operations (Q3192278) (← links)
- Spiking Neural P Systems Used as Acceptors and Transducers (Q3503887) (← links)
- Linear-Time Model Checking: Automata Theory in Practice (Q3503888) (← links)
- OpenFst: A General and Efficient Weighted Finite-State Transducer Library (Q3503890) (← links)
- Automata Applications in Chip-Design Software (Q3503891) (← links)
- Synchronizing Automata Preserving a Chain of Partial Orders (Q3503892) (← links)
- Reducing Acyclic Cover Transducers (Q3503893) (← links)