Pages that link to "Item:Q553312"

The following pages link to Descriptional and computational complexity of finite automata -- a survey (Q553312):

Displaying 50 items.

• The complexity of intersecting finite automata having few final states (Q347114) (← links)
• State complexity of the concatenation of regular tree languages (Q418803) (← links)
• Nondeterministic state complexity of star-free languages (Q442152) (← links)
• Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
• Walking on data words (Q504989) (← links)
• Parametric runtime verification is NP-complete and coNP-complete (Q522961) (← links)
• Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
• State complexity of inversion operations (Q896671) (← links)
• Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
• Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
• On the computational complexity of problems related to distinguishability sets (Q1706155) (← links)
• Simple picture processing based on finite automata and regular grammars (Q1747512) (← links)
• Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
• Alternation in two-way finite automata (Q2029487) (← links)
• Consensus string problem for multiple regular languages (Q2042725) (← links)
• Comparing the notions of opacity for discrete-event systems (Q2063098) (← links)
• Constant-space, constant-randomness verifiers with arbitrarily small error (Q2084769) (← links)
• Structural properties of NFAs and growth rates of nondeterminism measures (Q2113384) (← links)
• On the expressive power of stateless ordered restart-delete automata (Q2230720) (← links)
• A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
• State complexity of prefix distance (Q2357110) (← links)
• State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
• On the semantics of atomic subgroups in practical regular expressions (Q2399246) (← links)
• Complexity of suffix-free regular languages (Q2402364) (← links)
• A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) (← links)
• On linear languages recognized by deterministic biautomata (Q2672654) (← links)
• Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
• From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
• State Complexity of Prefix Distance of Subregular Languages (Q2829982) (← links)
• Problems on Finite Automata and the Exponential Time Hypothesis (Q2830210) (← links)
• Undecidability of state complexity (Q2855756) (← links)
• State Complexity of Kleene-Star Operations on Trees (Q2891328) (← links)
• COMPLEXITY IN UNION-FREE REGULAR LANGUAGES (Q2909101) (← links)
• State Complexity of Prefix Distance (Q2947426) (← links)
• Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
• Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
• The intersection problem for finite monoids (Q3304129) (← links)
• Scattered Factor-Universality of Words (Q5041246) (← links)
• (Q5089244) (← links)
• Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers* (Q5089680) (← links)
• Cellular Automata: Descriptional Complexity and Decidability (Q5112166) (← links)
• NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS (Q5173288) (← links)
• LIMITED AUTOMATA AND REGULAR LANGUAGES (Q5173292) (← links)
• Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
• Branching Measures and Nearly Acyclic NFAs (Q5205046) (← links)
• State Complexity of Suffix Distance (Q5205049) (← links)
• Worst Case Branching and Other Measures of Nondeterminism (Q5268392) (← links)
• On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata (Q5500690) (← links)
• Quasi-Distances and Weighted Finite Automata (Q5500694) (← links)
• The State Complexity of Permutations on Finite Languages over Binary Alphabets (Q5500695) (← links)