The following pages link to (Q4654639):
Displaying 9 items.
- Existential MSO over two successors is strictly weaker than over linear orders (Q837190) (← links)
- Definable transductions and weighted logics for texts (Q844894) (← links)
- Axiomatizing the identities of binoid languages (Q870834) (← links)
- On series-parallel pomset languages: rationality, context-freeness and automata (Q1734519) (← links)
- A note on identities of two-dimensional languages (Q1765373) (← links)
- Learning pomset automata (Q2233430) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Weighted Logics for Nested Words and Algebraic Formal Power Series (Q3519504) (← links)
- Languages of higher-dimensional automata (Q5076390) (← links)
