Pages that link to "Item:Q1236888"

The following pages link to Degree-languages: A new concept of acceptance (Q1236888):

Displayed 3 items.

• The Boolean closure of linear context-free languages (Q929298) ‎ (← links)
• On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) ‎ (← links)
• Concise representations of regular languages by degree and probabilistic finite automata (Q3142004) ‎ (← links)