Pages that link to "Item:Q2798705"
From MaRDI portal
The following pages link to Language and Automata Theory and Applications (Q2798705):
Displayed 50 items.
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- One-way reversible and quantum finite automata with advice (Q476173) (← links)
- On the list update problem with advice (Q515679) (← links)
- Weighted automata and logics for infinite nested words (Q515684) (← links)
- On finite-index indexed grammars and their restrictions (Q2042723) (← links)
- Efficient pattern matching in elastic-degenerate strings (Q2042726) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- Linear context-free tree languages and inverse homomorphisms (Q2280337) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- Insertion operations on deterministic reversal-bounded counter machines (Q2424688) (← links)
- Complexity of road coloring with prescribed reset words (Q2424693) (← links)
- Non-Zero Sum Games for Reactive Synthesis (Q2798706) (← links)
- Tangles and Connectivity in Graphs (Q2798707) (← links)
- Restricted Turing Machines and Language Recognition (Q2798708) (← links)
- Automata for Ontologies (Q2798709) (← links)
- Reasoning with Prototypes in the Description Logic $${\mathcal {ALC}}$$ ALC Using Weighted Tree Automata (Q2798710) (← links)
- $$+\omega $$ + ω -Picture Languages Recognizable by Büchi-Tiling Systems (Q2798711) (← links)
- A Logical Characterization for Dense-Time Visibly Pushdown Automata (Q2798712) (← links)
- A Complexity Measure on Büchi Automata (Q2798713) (← links)
- Compositional Bisimulation Minimization for Interval Markov Decision Processes (Q2798714) (← links)
- A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem (Q2798715) (← links)
- Colored Nested Words (Q2798716) (← links)
- Input-Driven Queue Automata with Internal Transductions (Q2798717) (← links)
- Periodic Generalized Automata over the Reals (Q2798718) (← links)
- Minimal Separating Sequences for All Pairs of States (Q2798719) (← links)
- Forkable Regular Expressions (Q2798720) (← links)
- On the Levenshtein Automaton and the Size of the Neighbourhood of a Word (Q2798721) (← links)
- Parallelogram Morphisms and Circular Codes (Q2798722) (← links)
- On Del-Robust Primitive Partial Words with One Hole (Q2798723) (← links)
- Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats (Q2798724) (← links)
- On XOR Lemma for Polynomial Threshold Weight and Length (Q2798725) (← links)
- The Beachcombers’ Problem: Walking and Searching from an Inner Point of a Line (Q2798726) (← links)
- Using Duality in Circuit Complexity (Q2798727) (← links)
- The Minimum Entropy Submodular Set Cover Problem (Q2798728) (← links)
- On the Capacity of Capacitated Automata (Q2798729) (← links)
- On Limited Nondeterminism and ACC Circuit Lower Bounds (Q2798730) (← links)
- The Complexity of Induced Tree Reconfiguration Problems (Q2798731) (← links)
- The Missing Case in Chomsky-Schützenberger Theorem (Q2798732) (← links)
- Homomorphic Characterizations of Indexed Languages (Q2798733) (← links)
- Ogden’s Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy (Q2798734) (← links)
- Steganography Based on Pattern Languages (Q2798735) (← links)
- Inferring a Relax NG Schema from XML Documents (Q2798737) (← links)
- Noise Free Multi-armed Bandit Game (Q2798738) (← links)
- Properties of Regular DAG Languages (Q2798739) (← links)
- Normal Form on Linear Tree-to-Word Transducers (Q2798740) (← links)
- A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids (Q2798741) (← links)
- Hankel Matrices for Weighted Visibly Pushdown Automata (Q2798742) (← links)
- Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages (Q2798744) (← links)
- The Word Problem for HNN-extensions of Free Inverse Semigroups (Q2798745) (← links)
- Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars (Q2798746) (← links)