Pages that link to "Item:Q5204349"
From MaRDI portal
The following pages link to Asynchronous cellular automata for infinite traces (Q5204349):
Displayed 13 items.
- Logical definability on infinite traces (Q672860) (← links)
- Muller message-passing automata and logics (Q948076) (← links)
- An extension of Kleene's and Ochmański's theorems to infinite traces (Q1318685) (← links)
- Asynchronous automata versus asynchronous cellular automata (Q1334661) (← links)
- On the complementation of asynchronous cellular Büchi automata (Q1349891) (← links)
- Classifying recognizable infinitary trace languages using word automata (Q2407086) (← links)
- An expressively complete linear time temporal logic for Mazurkiewicz traces (Q2506491) (← links)
- Classifying Recognizable Infinitary Trace Languages Using Word Automata (Q2922012) (← links)
- Logical definability on infinite traces (Q4630272) (← links)
- Determinizing asynchronous automata (Q4632421) (← links)
- On the complementation of Büchi asynchronous cellular automata (Q4632422) (← links)
- Keeping track of the latest gossip in a distributed system (Q5137336) (← links)
- Asynchronous cellular automata for infinite traces (Q5204349) (← links)