The following pages link to Developments in Language Theory (Q2817370):
Displayed 50 items.
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Minimal complexity of equidistributed infinite permutations (Q2400969) (← links)
- Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata (Q2817371) (← links)
- Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets (Q2817372) (← links)
- Cayley Automatic Groups and Numerical Characteristics of Turing Transducers (Q2817373) (← links)
- A Perfect Class of Context-Sensitive Timed Languages (Q2817374) (← links)
- Position Automaton Construction for Regular Expressions with Intersection (Q2817375) (← links)
- A Language-Theoretical Approach to Descriptive Complexity (Q2817376) (← links)
- k-Abelian Equivalence and Rationality (Q2817377) (← links)
- Schützenberger Products in a Category (Q2817378) (← links)
- Outfix-Guided Insertion (Q2817379) (← links)
- Both Ways Rational Functions (Q2817380) (← links)
- Aperiodic String Transducers (Q2817381) (← links)
- An Automata Characterisation for Multiple Context-Free Languages (Q2817383) (← links)
- Weighted Automata and Logics on Infinite Graphs (Q2817384) (← links)
- Degrees of Infinite Words, Polynomials and Atoms (Q2817385) (← links)
- Ternary Square-Free Partial Words with Many Wildcards (Q2817387) (← links)
- Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space (Q2817388) (← links)
- Weighted Symbolic Automata with Data Storage (Q2817389) (← links)
- On Families of Full Trios Containing Counter Machine Languages (Q2817390) (← links)
- Non-regular Maximal Prefix-Free Subsets of Regular Languages (Q2817391) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids (Q2817393) (← links)
- On Ordered RRWW-Automata (Q2817394) (← links)
- Bispecial Factors in the Brun S-Adic System (Q2817395) (← links)
- Compositions of Tree-to-Tree Statistical Machine Translation Models (Q2817396) (← links)
- On the Solvability Problem for Restricted Classes of Word Equations (Q2817397) (← links)
- Unambiguous Büchi Is Weak (Q2817398) (← links)
- One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations (Q2817399) (← links)
- Avoidability of Formulas with Two Variables (Q2817400) (← links)
- Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time (Q2817401) (← links)
- On Finite and Polynomial Ambiguity of Weighted Tree Automata (Q2817402) (← links)
- An Extremal Series of Eulerian Synchronizing Automata (Q2817403) (← links)
- Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata (Q2817405) (← links)
- On Automatic Transitive Graphs (Q2921970) (← links)
- Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals (Q2921971) (← links)
- On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States (Q2921972) (← links)
- State Complexity of Deletion (Q2921973) (← links)
- On Two Algorithmic Problems about Synchronizing Automata (Q2921974) (← links)
- Synchronizing Automata with Random Inputs (Q2921975) (← links)
- Graph Spectral Properties of Deterministic Finite Automata (Q2921976) (← links)
- Input-Driven Pushdown Automata with Limited Nondeterminism (Q2921977) (← links)
- How to Remove the Look-Ahead of Top-Down Tree Transducers (Q2921978) (← links)
- Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing (Q2921979) (← links)
- Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars (Q2921980) (← links)
- Aperiodic Tilings and Entropy (Q2921981) (← links)
- k-Abelian Pattern Matching (Q2921982) (← links)
- On k-Abelian Palindromic Rich and Poor Words (Q2921983) (← links)
- Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (Q2921984) (← links)
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word (Q2921985) (← links)