Pages that link to "Item:Q4506483"

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

Displaying 50 items.

• Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata (Q3618608) (← links)
• Analysing Complexity in Classes of Unary Automatic Structures (Q3618610) (← links)
• Hairpin Structures in DNA Words (Q3618686) (← links)
• Highly Undecidable Problems For Infinite Computations (Q3625697) (← links)
• Simulations by Time-Bounded Counter Machines (Q3637243) (← links)
• Foundations of RDF Databases (Q3638999) (← links)
• (Q3741058) (← links)
• (Q3833630) (← links)
• If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
• A decidable timeout-based extension of linear temporal logic (Q4583356) (← links)
• The genus of regular languages (Q4599611) (← links)
• Bisimulations of Boolean Control Networks (Q4602534) (← links)
• General Framework (Q4613545) (← links)
• TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS (Q4626611) (← links)
• Infinitude of Primes Using Formal Languages (Q4685121) (← links)
• Circular splicing and regularity (Q4825394) (← links)
• Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
• A DRIVEN IFS REPRESENTATION OF TURING MACHINES (Q4961162) (← links)
• (Q4988158) (← links)
• (Q4988166) (← links)
• Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference (Q4989176) (← links)
• The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian (Q4995608) (← links)
• (Q5013820) (← links)
• (Q5020537) (← links)
• (Q5021015) (← links)
• (Q5021232) (← links)
• (Q5028446) (← links)
• (Q5028456) (← links)
• The State Complexity of Lexicographically Smallest Words and Computing Successors (Q5041251) (← links)
• A Study of a Simple Class of Modifiers: Product Modifiers (Q5041253) (← links)
• Computational Hardness of Multidimensional Subtraction Games (Q5042244) (← links)
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
• (Q5077009) (← links)
• (Q5077538) (← links)
• LIPSCHITZ EQUIVALENCE OF SELF-SIMILAR SETS AND FINITE-STATE AUTOMATON (Q5082134) (← links)
• Minimal auxiliary Markov chains through sequential elimination of states (Q5085915) (← links)
• Semicomputable points in Euclidean spaces (Q5092426) (← links)
• A congruence-based perspective on automata minimization algorithms (Q5092441) (← links)
• Sequential Relational Decomposition (Q5094122) (← links)
• Characterizing regular languages with polynomial densities (Q5096862) (← links)
• Interleaving vs True Concurrency: Some Instructive Security Examples (Q5100754) (← links)
• Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations (Q5107065) (← links)
• Compositional Specification in Rewriting Logic (Q5108529) (← links)
• (Q5111650) (← links)
• The Computing Power of Determinism and Reversibility in Chemical Reaction Automata (Q5112176) (← links)
• Agent-Based Modeling, Mathematical Formalism for (Q5150305) (← links)
• MINIMIZATION OF CONTEXT-FREE GRAMMARS (Q5151280) (← links)
• (Q5155665) (← links)
• A Locally Optimal Algorithm for Estimating a Generating Partition from an Observed Time Series and Its Application to Anomaly Detection (Q5157238) (← links)
• Minimal Size of Counters for (Real-Time) Multicounter Automata (Q5158661) (← links)