Pages that link to "Item:Q4506483"
From MaRDI portal
The following pages link to Introduction to automata theory, languages, and computation. (Q4506483):
Displaying 50 items.
- Context-Bounded Analysis of TSO Systems (Q5170741) (← links)
- Weak Inclusion for XML Types (Q5200049) (← links)
- Bouma2 – A High-Performance Input-Aware Multiple String-Match Algorithm (Q5200052) (← links)
- The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata (Q5200083) (← links)
- State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal (Q5200089) (← links)
- Regular and linear permutation languages (Q5223617) (← links)
- Progressive events in supervisory control and compositional verification (Q5257781) (← links)
- Equations, Contractions, and Unique Solutions (Q5278202) (← links)
- Lossiness of communication channels modeled by transducers1 (Q5283445) (← links)
- Random graph languages (Q5347254) (← links)
- Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words (Q5384126) (← links)
- Context-Freeness of Parsing Expression Languages is Undecidable (Q5384531) (← links)
- A hierarchy of tree-automatic structures (Q5388735) (← links)
- (Q5389839) (← links)
- Tree Process Calculus (Q5415625) (← links)
- (Q5416362) (← links)
- Language-measure-theoretic optimal control of probabilistic finite-state systems (Q5423836) (← links)
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata (Q5459921) (← links)
- Products of ‘transitive” modal logics (Q5718700) (← links)
- Linear Parsing Expression Grammars (Q5739004) (← links)
- Over Which Monoids is the Transducer Determinization Procedure Applicable? (Q5739012) (← links)
- Perfect Discrimination Graphs: Indexing Terms with Integer Exponents (Q5747777) (← links)
- Palindromic Characteristic of Committed Graphs and Some Model Theoretic Properties (Q5859628) (← links)
- Membership Problem for Two-Dimensional General Row Jumping Finite Automata (Q5859631) (← links)
- Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
- A Proof of Parikh’s Theorem via Dickson’s Lemma (Q5859679) (← links)
- <i>p</i>-values for the Discrete Scan Statistic through Slack Variables (Q5860233) (← links)
- Counting clusters in a coloring grid (Q5862687) (← links)
- Long-Run Average Behavior of Vector Addition Systems with States (Q5875389) (← links)
- A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions (Q5875940) (← links)
- Automata Theory and Formal Languages (Q5882966) (← links)
- Boundedness problems for Minsky counter machines (Q5892524) (← links)
- Calculational design of a regular model checker by abstract interpretation (Q5896884) (← links)
- The computational power of parsing expression grammars (Q5915559) (← links)
- Boundedness problems for Minsky counter machines (Q5917948) (← links)
- A general architecture of oritatami systems for simulating arbitrary finite automata (Q5918272) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)
- Learners based on transducers (Q5918614) (← links)
- Input-driven pushdown automata for edit distance neighborhood (Q5918675) (← links)
- Complement for two-way alternating automata (Q5919102) (← links)
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) (Q5919539) (← links)
- Fuzzy pushdown automata (Q5919885) (← links)
- Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
- Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\) (Q5920059) (← links)
- On-line path computation and function placement in SDNs (Q5920222) (← links)
- Enumerating permutations sortable by \(k\) passes through a pop-stack (Q5925190) (← links)
- Watson-Crick palindromes in DNA computing (Q5962061) (← links)
- On the regularity of circular splicing languages: a survey and new developments (Q5962067) (← links)
- Never-stop context-free learning (Q6045031) (← links)
- Complexity of qualitative timeline-based planning (Q6060102) (← links)