Pages that link to "Item:Q1322488"
From MaRDI portal
The following pages link to On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages (Q1322488):
Displaying 7 items.
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Mixed product and asynchronous automata (Q1099643) (← links)
- Asynchronous automata versus asynchronous cellular automata (Q1334661) (← links)
- Trace languages defined by regular string languages (Q3753510) (← links)
- Notes on finite asynchronous automata (Q3761703) (← links)
- Probabilistic asynchronous automata (Q4864443) (← links)
- Model matching of switched asynchronous sequential machines via matrix approach (Q5197948) (← links)