The following pages link to Daniel Průša (Q896687):
Displaying 28 items.
- Non-recursive trade-offs between two-dimensional automata and grammars (Q896688) (← links)
- (Q1622983) (redirect page) (← links)
- Two-way automata and one-tape machines - read only versus linear time (Q1622984) (← links)
- Dynamics of the independence number and automata synchronization (Q1622986) (← links)
- Two-dimensional pattern matching against local and regular-like picture languages (Q2029490) (← links)
- Complexity of two-dimensional rank-reducing grammars (Q2040419) (← links)
- Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419) (← links)
- A simple extension to finite tree automata for defining sets of labeled, connected graphs (Q2177604) (← links)
- Two-dimensional pattern matching against basic picture languages (Q2177609) (← links)
- Undecidability of the emptiness problem for context-free picture languages (Q2357111) (← links)
- Complexity of Sets of Two-Dimensional Patterns (Q2830224) (← links)
- Restarting Tiling Automata (Q2914717) (← links)
- (Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars (Q2947427) (← links)
- Some classes of rational functions for pictures (Q2969984) (← links)
- Two-Dimensional Sgraffito Automata (Q3167500) (← links)
- (Q3398151) (← links)
- LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP (Q4575832) (← links)
- Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton (Q4605517) (← links)
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices (Q5041266) (← links)
- Template-Based Pattern Matching in Two-Dimensional Arrays (Q5077666) (← links)
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program (Q5231683) (← links)
- Two-dimensional Sgraffito automata (Q5248876) (← links)
- New Results on Deterministic Sgraffito Automata (Q5300858) (← links)
- Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata (Q5327501) (← links)
- RESTARTING TILING AUTOMATA (Q5401561) (← links)
- Weight-Reducing Hennie Machines and Their Descriptional Complexity (Q5404943) (← links)
- Non-recursive Trade-offs between Two-Dimensional Automata and Grammars (Q5496202) (← links)
- Weight-reducing Turing machines (Q6040666) (← links)
