Pages that link to "Item:Q1386414"

The following pages link to Context-free languages over infinite alphabets (Q1386414):

Displaying 18 items.

• On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
• Regular and context-free nominal traces (Q530218) (← links)
• A new pumping lemma for indexed languages, with an application to infinite words (Q729820) (← links)
• Classes of regular and context-free languages over countably infinite alphabets (Q1068559) (← links)
• An algebraic characterization of deterministic regular languages over infinite alphabets. (Q1426447) (← links)
• Algorithmic games for full ground references (Q1650867) (← links)
• Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
• Reachability in pushdown register automata (Q2396722) (← links)
• Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
• Nominal Automata for Resource Usage Control (Q2914700) (← links)
• A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions (Q2915170) (← links)
• FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT (Q3056277) (← links)
• The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets (Q3547014) (← links)
• Linear equations for unordered data vectors in $[D]^k\to{}Z^d$ (Q5060183) (← links)
• Tree Automata over Infinite Alphabets (Q5452188) (← links)
• Optimal run problem for weighted register automata (Q5919052) (← links)
• A taxonomy and reductions for common register automata formalisms (Q6045033) (← links)
• Automata and grammars for data words (Q6666782) (← links)