Pages that link to "Item:Q3740247"

The following pages link to Complexity of some problems from the theory of automata (Q3740247):

Displaying 32 items.

• Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
• Recent results on syntactic groups of prefix codes. (Q444391) (← links)
• On the word problem for syntactic monoids of piecewise testable languages. (Q444643) (← links)
• Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
• Finite-automaton aperiodicity is PSPACE-complete (Q809608) (← links)
• Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words (Q832937) (← links)
• Characterization of idempotent transformation monoids (Q1119394) (← links)
• Efficient simplicity testing of automata (Q1193902) (← links)
• Some results on the generalized star-height problem (Q1207944) (← links)
• Languages recognized by finite aperiodic groupoids (Q1274931) (← links)
• From cascade decompositions to bit-vector algorithms. (Q1426154) (← links)
• \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata (Q1575552) (← links)
• LANGAGE: A Maple package for automaton characterization of regular languages (Q1575906) (← links)
• Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
• Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
• On shuffle products, acyclic automata and piecewise-testable languages (Q1730033) (← links)
• Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
• Logic, semigroups and automata on words (Q1817074) (← links)
• Some complexity results for polynomial rational expressions. (Q1874419) (← links)
• On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
• On the expressive power of temporal logic (Q2366686) (← links)
• Deciding FO-definability of regular languages (Q2695357) (← links)
• Problems on Finite Automata and the Exponential Time Hypothesis (Q2830210) (← links)
• On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (Q2914712) (← links)
• Complexity Analysis: Transformation Monoids of Finite Automata (Q3451097) (← links)
• Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
• PSPACE-completeness of certain algorithmic problems on the subgroups of free groups (Q4632433) (← links)
• Testing membership: Beyond permutation groups (Q5096172) (← links)
• New results on the generalized star-height problem (Q5096178) (← links)
• The descriptive complexity approach to LOGCFL (Q5946058) (← links)
• Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
• Forbidden Patterns for FO² Alternation Over Finite and Infinite Words (Q6169964) (← links)