Pages that link to "Item:Q2752466"
From MaRDI portal
The following pages link to Finite automata with generalized acceptance criteria (Q2752466):
Displaying 7 items.
- Leaf languages and string compression (Q550251) (← links)
- Generalized acceptance, succinctness and supernondeterministic finite automata. (Q1426171) (← links)
- On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) (← links)
- A characterization of definability of second-order generalized quantifiers with applications to non-definability (Q2453584) (← links)
- On Second-Order Monadic Groupoidal Quantifiers (Q3511462) (← links)
- Automaton-Based Criteria for Membership in CTL (Q5145288) (← links)
- (Q6070602) (← links)