Pages that link to "Item:Q1816738"

The following pages link to Automaticity. I: Properties of a measure of descriptional complexity (Q1816738):

Displaying 21 items.

• Algorithmic introduction of quantified cuts (Q402115) (← links)
• Learning finite cover automata from queries (Q414872) (← links)
• Automaticity. IV: Sequences, sets, and diversity (Q679096) (← links)
• Finite state complexity (Q719308) (← links)
• Detecting palindromes, patterns and borders in regular languages (Q1041028) (← links)
• Automaticity. II: Descriptional complexity in the unary case (Q1390867) (← links)
• Succinct representations of languages by DFA with different levels of reliability (Q1763718) (← links)
• Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
• Enumerating regular expressions and their languages (Q2074215) (← links)
• Generalising automaticity to modal properties of finite structures (Q2373714) (← links)
• On the existence of regular approximations (Q2465045) (← links)
• Hartmanis-Stearns Conjecture on Real Time and Transcendence (Q2891306) (← links)
• STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY (Q2909179) (← links)
• Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines (Q3172836) (← links)
• Approximate Automata for Omega-Regular Languages (Q3297599) (← links)
• Finite Automata, Palindromes, Powers, and Patterns (Q3540097) (← links)
• On a conjecture of J. Shallit (Q4571998) (← links)
• The binomial equivalence classes of finite words (Q4970534) (← links)
• Remarks on Separating Words (Q5200088) (← links)
• Compressibility of Finite Languages by Grammars (Q5500684) (← links)
• Minimal cover-automata for finite languages (Q5958721) (← links)