Pages that link to "Item:Q1068559"
From MaRDI portal
The following pages link to Classes of regular and context-free languages over countably infinite alphabets (Q1068559):
Displayed 4 items.
- An algebraic characterization of deterministic regular languages over infinite alphabets. (Q1426447) (← links)
- CLASS COUNTING AUTOMATA ON DATAWORDS (Q3016221) (← links)
- Counting Multiplicity over Infinite Alphabets (Q3646259) (← links)
- P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA (Q5495416) (← links)