Pages that link to "Item:Q1083210"
From MaRDI portal
The following pages link to Characterizations of some classes of regular events (Q1083210):
Displaying 27 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Piecewise testable languages via combinatorics on words (Q641179) (← links)
- Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words (Q832937) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Polynomial closure and unambiguous product (Q1361889) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups (Q1731800) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- On the height of towers of subsequences and prefixes (Q2272979) (← links)
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (Q2914712) (← links)
- On Upper and Lower Bounds on the Length of Alternating Towers (Q2922026) (← links)
- Theme and Variations on the Concatenation Product (Q3014930) (← links)
- The Boolean Algebra of Piecewise Testable Languages (Q3188268) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- Injective envelopes of transition systems and Ferrers languages (Q3298124) (← links)
- Hierarchies of Piecewise Testable Languages (Q3533034) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES (Q3586402) (← links)
- On Shuffle Ideals (Q4405554) (← links)
- The product of rational languages (Q4630281) (← links)
- Polynomial closure and unambiguous product (Q4645191) (← links)
- REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT (Q4658714) (← links)
- The pseudovariety of semigroups of triangular matrices over a finite field (Q4680725) (← links)
- LANGUAGES VERSUS ω-LANGUAGES IN REGULAR INFINITE GAMES (Q4902889) (← links)
- (Q4988163) (← links)
- (Q5005165) (← links)
- Forbidden Patterns for FO<sup>2</sup> Alternation Over Finite and Infinite Words (Q6169964) (← links)
