The following pages link to Developments in Language Theory (Q2817370):
Displayed 50 items.
- Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings (Q2921986) (← links)
- Eigenvalues and Transduction of Morphic Sequences (Q2921988) (← links)
- Breadth-First Serialisation of Trees and Rational Languages (Q2921989) (← links)
- Measuring Communication in Automata Systems (Q2921990) (← links)
- From Algebra to Logic: There and Back Again The Story of a Hierarchy (Q2921991) (← links)
- Closure Properties of Pattern Languages (Q2921992) (← links)
- Deterministic Set Automata (Q2921993) (← links)
- The Minimum Amount of Useful Space: New Results and New Directions (Q2921994) (← links)
- Embedding Finite and Infinite Words into Overlapping Tiles (Q2921995) (← links)
- The Kind Hearted Dragon Prof. Sheng Yu, 1950-2012 (Q3167477) (← links)
- P and dP Automata: Unconventional versus Classical Automata (Q3167478) (← links)
- Recovering Strings in Oracles: Quantum and Classic (Q3167479) (← links)
- Determinism vs. Nondeterminism for Two-Way Automata (Q3167481) (← links)
- Cellular Automata, the Collatz Conjecture and Powers of 3/2 (Q3167482) (← links)
- Quotient Complexities of Atoms of Regular Languages (Q3167483) (← links)
- Decidability of Geometricity of Regular Languages (Q3167484) (← links)
- Inside the Class of REGEX Languages (Q3167485) (← links)
- Computing the Edit-Distance between a Regular Language and a Context-Free Language (Q3167486) (← links)
- Semigroups with a Context-Free Word Problem (Q3167487) (← links)
- Generalized Derivations with Synchronized Context-Free Grammars (Q3167488) (← links)
- Non-erasing Variants of the Chomsky–Schützenberger Theorem (Q3167489) (← links)
- Regular and Context-Free Pattern Languages over Small Alphabets (Q3167490) (← links)
- On Context-Free Languages of Scattered Words (Q3167491) (← links)
- Homomorphisms Preserving Deterministic Context-Free Languages (Q3167492) (← links)
- Unary Coded NP-Complete Languages in ASPACE (log log n) (Q3167493) (← links)
- Dense Completeness (Q3167494) (← links)
- From Equivalence to Almost-Equivalence, and Beyond—Minimizing Automata with Errors (Q3167495) (← links)
- Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata (Q3167496) (← links)
- States and Heads Do Count for Unary Multi-head Finite Automata (Q3167497) (← links)
- Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness (Q3167498) (← links)
- Unambiguous Constrained Automata (Q3167499) (← links)
- Two-Dimensional Sgraffito Automata (Q3167500) (← links)
- Two-Way Transducers with a Two-Way Output Tape (Q3167501) (← links)
- Learning Rational Functions (Q3167502) (← links)
- Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata (Q3167503) (← links)
- Fine and Wilf’s Theorem for k-Abelian Periods (Q3167504) (← links)
- Pseudoperiodic Words (Q3167505) (← links)
- Acceptance Conditions for ω-Languages (Q3167506) (← links)
- Checking Determinism of Regular Expressions with Counting (Q3167507) (← links)
- Biautomata for k-Piecewise Testable Languages (Q3167508) (← links)
- On Centralized PC Grammar Systems with Context-Sensitive Components (Q3167509) (← links)
- Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars (Q3167510) (← links)
- The State Complexity of Star-Complement-Star (Q3167511) (← links)
- On State Complexity of Finite Word and Tree Languages (Q3167512) (← links)
- Squares in Binary Partial Words (Q3167513) (← links)
- The Avoidability of Cubes under Permutations (Q3167514) (← links)
- Hairpin Completion with Bounded Stem-Loop (Q3167515) (← links)
- Morphic Primitivity and Alphabet Reductions (Q3167516) (← links)
- On a Hierarchy of Languages with Catenation and Shuffle (Q3167517) (← links)
- Characterizing Languages by Normalization and Termination in String Rewriting (Q3167518) (← links)