Pages that link to "Item:Q1330656"
From MaRDI portal
The following pages link to An optimal lower bound for nonregular languages (Q1330656):
Displaying 14 items.
- Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
- Corrigendum to ``An optimal lower bound for nonregular languages'' (Q1342265) (← links)
- Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language \(R \) with \(R_{1}\subseteq R\subseteq R_{2}\) for given regular languages \(R_{1},R_{2}\). (Q1853563) (← links)
- Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
- A space lower bound for acceptance by one-way \(\Pi_2\)-alternating machines (Q2720409) (← links)
- New results on the minimum amount of useful space (Q2814840) (← links)
- Non-regular Maximal Prefix-Free Subsets of Regular Languages (Q2817391) (← links)
- The magic number problem for subregular language families (Q2909186) (← links)
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← links)
- Hyper-minimizing minimized deterministic finite state automata (Q3549289) (← links)
- On languages accepted with simultaneous complexity bounds and their ranking problem (Q5096881) (← links)
- TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES (Q5168415) (← links)
- Preface (Q5898759) (← links)
- Push complexity: optimal bounds and unary inputs (Q6666805) (← links)
