Pages that link to "Item:Q2555753"

The following pages link to Absolutely parallel grammars and two-way finite-state transducers (Q2555753):

Displaying 20 items.

• A note on Parikh maps, abstract languages, and decision problems (Q1065555) (← links)
• Tree transducers, L systems, and two-way machines (Q1136239) (← links)
• 2DST mappings of languages and related problems (Q1164438) (← links)
• The string generating power of context-free hypergraph grammars (Q1176107) (← links)
• Iterated stack automata and complexity classes (Q1183602) (← links)
• Two-way A-transducers and AFL (Q1216181) (← links)
• Characterization theorems on abstract families of transducers (Q1230515) (← links)
• One way finite visit automata (Q1242687) (← links)
• Classes of formal grammars (Q1248342) (← links)
• On two-way sequential transductions of full semi-AFL's (Q1249942) (← links)
• Some decision problems concerning sequential transducers and checking automata (Q1256855) (← links)
• Equivalence problem of mappings relative to languages (Q1364102) (← links)
• Reasoning about strings in databases (Q1807679) (← links)
• Absolutely parallel grammars and two-way finite-state transducers (Q2555753) (← links)
• Characterizations of regular and context-free matrices (Q4057628) (← links)
• (Q4170259) (← links)
• Concatenation of graphs (Q4645288) (← links)
• Outils et résultats pour les transducteurs boustrophédons (Q4728282) (← links)
• Three hierarchies of transducers (Q4747534) (← links)
• Using acceptors as transducers (Q5958726) (← links)