Classes of regular and context-free languages over countably infinite alphabets

DOI10.1016/0166-218X(85)90039-3zbMath0582.68046MaRDI QIDQ1068559

Friedrich Otto

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

context-free languagesregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

An algebraic characterization of deterministic regular languages over infinite alphabets. ⋮ CLASS COUNTING AUTOMATA ON DATAWORDS ⋮ Counting Multiplicity over Infinite Alphabets ⋮ P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA

Cites Work

• Langages sur des alphabets infinis
• Rekursive Wortfunktionen Über Unendlichen Alphabeten
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Classes of regular and context-free languages over countably infinite alphabets