Pages that link to "Item:Q4506483"

The following pages link to Introduction to automata theory, languages, and computation. (Q4506483):

Displaying 50 items.

• Separating Codes and Traffic Monitoring (Q2830061) (← links)
• Recursively Generated Evolutionary Turing Machines and Evolutionary Automata (Q2866110) (← links)
• An Extended Strange Planet Protocol (Q2867121) (← links)
• Undecidable control conditions in graph transformation units (Q2873611) (← links)
• Grammar-based integer programming models for multi-activity shift scheduling (Q2883642) (← links)
• Combining Graph Transformation and Algebraic Specification into Model Transformation (Q2890331) (← links)
• On the decidability of semigroup freeness. (Q2905326) (← links)
• Deciding Regular Expressions (In-)Equivalence in Coq (Q2915138) (← links)
• Modeling Musical Structure with Parametric Grammars (Q2942306) (← links)
• Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
• The Word Problem for Finitely Presented Quandles is Undecidable (Q2947455) (← links)
• A pumping lemma for flip-pushdown languages (Q2969981) (← links)
• The Evolutionary Resilience of Distributed Cellular Computing (Q2975899) (← links)
• Dynamic Complexity of the Dyck Reachability (Q2988373) (← links)
• Natural Language Processing, Moving from Rules to Data (Q2988808) (← links)
• Incompleteness Theorems, Large Cardinals, and Automata over Finite Words (Q2988824) (← links)
• Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
• Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages (Q3014932) (← links)
• Incremental DFA Minimisation (Q3073619) (← links)
• Finite Automata for Generalized Approach to Backward Pattern Matching (Q3073621) (← links)
• Better Hyper-minimization (Q3073639) (← links)
• (Q3098047) (← links)
• (Q3098058) (← links)
• Some problems in automata theory which depend on the models of set theory (Q3117545) (← links)
• Primitive Sets of Nonnegative Matrices and Synchronizing Automata (Q3130423) (← links)
• Using finite state automata (FSA) for formal modelling of affordances in human-machine cooperative manufacturing systems (Q3163709) (← links)
• (Q3165666) (← links)
• The Generative Power of Probabilistic and Weighted Context-Free Grammars (Q3172827) (← links)
• Modeling for Verification (Q3176361) (← links)
• Universal Sleptsov net (Q3177465) (← links)
• (Q3289363) (← links)
• (Q3305193) (← links)
• Active XML document rewriting based on tree automata theory (Q3446029) (← links)
• Generalized language measure families of probabilistic finite state systems (Q3447010) (← links)
• Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words (Q3449478) (← links)
• Generalizations of Code Languages with Marginal Errors (Q3451108) (← links)
• Polymorphic P Systems with Non-cooperative Rules and No Ingredients (Q3454896) (← links)
• Trace Semantics for IPDL (Q3457701) (← links)
• Parametric Language Analysis of the Class of Stop-and-Wait Protocols (Q3510867) (← links)
• The growth of iterates of multivariate generating functions (Q3518203) (← links)
• Learning Left-to-Right and Right-to-Left Iterative Languages (Q3528409) (← links)
• More Concise Representation of Regular Languages by Automata and Regular Expressions (Q3533024) (← links)
• Characterization of Star-Connected Languages Using Finite Automata (Q3540123) (← links)
• Evaluation of language measure parameters for discrete event manufacturing systems with multiproduct machines (Q3542918) (← links)
• Hyper-minimizing minimized deterministic finite state automata (Q3549289) (← links)
• Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
• Computation in Sofic Quantum Dynamical Systems (Q3603417) (← links)
• Composition of Use Cases Using Synchronization and Model Checking (Q3613075) (← links)
• A Kleene Theorem for Polynomial Coalgebras (Q3617725) (← links)
• Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (Q3617729) (← links)