Pages that link to "Item:Q2830201"
From MaRDI portal
The following pages link to Implementation and Application of Automata (Q2830201):
Displayed 50 items.
- Synchronization of Automata with One Undefined or Ambiguous Transition (Q2914716) (← links)
- Restarting Tiling Automata (Q2914717) (← links)
- Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$-Clauses (Q2914718) (← links)
- Factor and Subsequence Kernels and Signatures of Rational Languages (Q2914720) (← links)
- Multi-Tilde-Bar Derivatives (Q2914721) (← links)
- On Positive TAGED with a Bounded Number of Constraints (Q2914722) (← links)
- SDFA: Series DFA for Memory-Efficient Regular Expression Matching (Q2914723) (← links)
- The Removal of Weighted ε-Transitions (Q2914724) (← links)
- Weighted LTL with Discounting (Q2914725) (← links)
- Automata with Modulo Counters and Nondeterministic Counter Bounds (Q2914726) (← links)
- Automata and Logics for Concurrent Systems: Five Models in Five Pages (Q2947404) (← links)
- Hardware Implementations of Finite Automata and Regular Expressions (Q2947405) (← links)
- Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems (Q2947406) (← links)
- From Ambiguous Regular Expressions to Deterministic Parsing Automata (Q2947407) (← links)
- Deciding Synchronous Kleene Algebra with Derivatives (Q2947408) (← links)
- On the Hierarchy of Block Deterministic Languages (Q2947409) (← links)
- Security of Numerical Sensors in Automata (Q2947411) (← links)
- Jumping Finite Automata: Characterizations and Complexity (Q2947412) (← links)
- Run-Length Encoded Nondeterministic KMP and Suffix Automata (Q2947413) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- On the Number of Synchronizing Colorings of Digraphs (Q2947415) (← links)
- On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism (Q2947416) (← links)
- Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata (Q2947417) (← links)
- Subword Metrics for Infinite Words (Q2947418) (← links)
- From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods (Q2947420) (← links)
- Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata (Q2947421) (← links)
- Expressive Capacity of Concatenation Freeness (Q2947422) (← links)
- The Membership Problem for Linear and Regular Permutation Languages (Q2947424) (← links)
- Classical and Quantum Counter Automata on Promise Problems (Q2947425) (← links)
- State Complexity of Prefix Distance (Q2947426) (← links)
- (Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars (Q2947427) (← links)
- On the Disambiguation of Weighted Automata (Q2947428) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
- On the Semantics of Regular Expression Parsing in the Wild (Q2947430) (← links)
- BSP: A Parsing Tool for Ambiguous Regular Expressions (Q2947431) (← links)
- Using Automata to Describe Self-Assembled Nanostructures (Q3073614) (← links)
- A Summary of Some Discrete-Event System Control Problems (Q3073615) (← links)
- Large-Scale Training of SVMs with Automata Kernels (Q3073616) (← links)
- Filters for Efficient Composition of Weighted Finite-State Transducers (Q3073618) (← links)
- Incremental DFA Minimisation (Q3073619) (← links)
- Finite Automata for Generalized Approach to Backward Pattern Matching (Q3073621) (← links)
- Partial Derivative Automata Formalized in Coq (Q3073622) (← links)
- Regular Geometrical Languages and Tiling the Plane (Q3073623) (← links)
- COMPAS - A Computing Package for Synchronization (Q3073624) (← links)
- From Sequential Extended Regular Expressions to NFA with Symbolic Labels (Q3073625) (← links)
- State Complexity of Catenation Combined with Union and Intersection (Q3073626) (← links)
- Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract) (Q3073627) (← links)
- On Straight Words and Minimal Permutators in Finite Transformation Semigroups (Q3073628) (← links)
- On Lazy Representations and Sturmian Graphs (Q3073629) (← links)
- Symbolic Dynamics, Flower Automata and Infinite Traces (Q3073631) (← links)