Pages that link to "Item:Q1361884"
From MaRDI portal
The following pages link to Monadic second-order definable text languages (Q1361884):
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)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
- Weighted automata (Q2074206) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Weighted Automata and Logics on Infinite Graphs (Q2817384) (← links)
- A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. (Q5005180) (← links)
