Classes of regular and context-free languages over countably infinite alphabets
From MaRDI portal
Publication:1068559
DOI10.1016/0166-218X(85)90039-3zbMath0582.68046MaRDI QIDQ1068559
Publication date: 1985
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
An algebraic characterization of deterministic regular languages over infinite alphabets., CLASS COUNTING AUTOMATA ON DATAWORDS, Counting Multiplicity over Infinite Alphabets
Cites Work