P Finite Automata and Regular Languages over Countably Infinite Alphabets

DOI10.1007/11963516_23zbMath1187.68294OpenAlexW2159640064MaRDI QIDQ3591025

Juergen Dassow, György Vaszil

Publication date: 3 September 2007

Published in: Membrane Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Variants of Distributed P Automata and the Efficient Parallelizability of Languages ⋮ Set augmented finite automata over infinite alphabets ⋮ P and dP Automata: A Survey ⋮ (Mem)brane automata ⋮ P automata revisited

This page was built for publication: P Finite Automata and Regular Languages over Countably Infinite Alphabets