Automata on Distributed Alphabets

DOI10.1142/9789814271059_0009zbMath1256.68109OpenAlexW2400524903MaRDI QIDQ4907861

Madhavan Mukund

Publication date: 26 February 2013

Published in: Modern Applications of Automata Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/413449e81973eec0701c4df2b4864cbc9eff2c59

zbMATH Keywords

distributed systemsautomataasynchronous automatasynchronous productsautomata on distributed alphabets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Classifying Recognizable Infinitary Trace Languages Using Word Automata ⋮ Classifying recognizable infinitary trace languages using word automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Kleene Theorems for Synchronous Products with Matching

This page was built for publication: Automata on Distributed Alphabets