P Finite Automata and Regular Languages over Countably Infinite Alphabets

DOI10.1007/11963516_23MaRDI QIDQ3591025zbMATH OpenOpenAlexFDO

Authors Jürgen 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)

Recommendations

• Classes of regular and context-free languages over countably infinite alphabets
• Regular expressions for languages over infinite alphabets
• Computing and Combinatorics
• scientific article; zbMATH DE number 1834677
• Finite state machines for strings over infinite alphabets

Cited in

(12)

• Classes of regular and context-free languages over countably infinite alphabets
• On a subclass of \(\infty\)-regular languages
• Morphisms on infinite alphabets, countable states automata and regular sequences
• Automata generated p-languages
• Variants of distributed P automata and the efficient parallelizability of languages
• P and dP automata: a survey
• Variable automata over infinite alphabets
• Computing and Combinatorics
• Regular expressions for languages over infinite alphabets
• Set augmented finite automata over infinite alphabets
• P automata revisited
• (Mem)brane automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591025)