Pages that link to "Item:Q1151054"
From MaRDI portal
The following pages link to Flow languages equal recursively enumerable languages (Q1151054):
Displayed 10 items.
- On the enlargement of the class of regular languages by the shuffle closure (Q760799) (← links)
- Algèbre de processus et synchronisation (Q789894) (← links)
- Extending regular expressions with iterated shuffle (Q1063422) (← links)
- Literal shuffle (Q1098321) (← links)
- Relations of flow languages to Petri net languages (Q1158771) (← links)
- A P-complete language describable with iterated shuffle (Q1197969) (← links)
- Shuffle and scattered deletion closure of languages (Q1575737) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- On the expressive power of the shuffle operator matched with intersection by regular sets (Q4331053) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)