Pages that link to "Item:Q3030260"

The following pages link to Systolic trellis automata: Stability, decidability and complexity (Q3030260):

Displaying 13 items.

• Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
• On the number of nonterminals in linear conjunctive grammars (Q596108) (← links)
• Characterizations and computational complexity of systolic trellis automata (Q792091) (← links)
• Synthesis, structure and power of systolic computations (Q913515) (← links)
• Languages accepted by systolic \(Y\)-tree automata: Structural characterizations (Q1323359) (← links)
• Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata (Q1323376) (← links)
• Boolean grammars (Q1886037) (← links)
• Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
• Recognition of poly-slender context-free languages by trellis automata (Q2401759) (← links)
• Sur quelques classes d’applications de $N^2$ dans les ensembles finis (Q3031941) (← links)
• BOOLEAN GRAMMARS AND GSM MAPPINGS (Q3056280) (← links)
• (Q3339293) (← links)
• On the equivalence of linear conjunctive grammars and trellis automata (Q4825389) (← links)