Context-free languages over infinite alphabets

DOI10.1007/s002360050120zbMath0896.68088OpenAlexW1994458424MaRDI QIDQ1386414

Michael Kaminski, Edward Y. C. Cheng

Publication date: 24 May 1998

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050120

zbMATH Keywords

contextfree grammarspushdown automata over infinite alphabets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (15)

Reactive synthesis from visibly register pushdown automata ⋮ Linear equations for unordered data vectors in $[D^k\to{}Z^d$] ⋮ Nominal Automata for Resource Usage Control ⋮ Algorithmic games for full ground references ⋮ On temporal logics with data variable quantifications: decidability and complexity ⋮ Reachability in pushdown register automata ⋮ Complexity results on register context-free grammars and related formalisms ⋮ A taxonomy and reductions for common register automata formalisms ⋮ Set augmented finite automata over infinite alphabets ⋮ Active learning for deterministic bottom-up nominal tree automata ⋮ An algebraic characterization of deterministic regular languages over infinite alphabets. ⋮ Regular and context-free nominal traces ⋮ FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT ⋮ Tree Automata over Infinite Alphabets ⋮ Optimal run problem for weighted register automata

This page was built for publication: Context-free languages over infinite alphabets