The following pages link to Bruno Guillon (Q476167):
Displaying 17 items.
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Non-self-embedding grammars, constant-height pushdown automata, and limited automata (Q1616972) (← links)
- Two-way automata and one-tape machines - read only versus linear time (Q1622984) (← links)
- Counter machines and distributed automata -- a story about exchanging space and time (Q1656682) (← links)
- Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419) (← links)
- Both Ways Rational Functions (Q2817380) (← links)
- An Algebraic Characterization of Unary Two-Way Transducers (Q2922014) (← links)
- Input- or output-unary sweeping transducers are weaker than their 2-way counterparts (Q2969980) (← links)
- (Q5111446) (← links)
- (Q5216303) (← links)
- Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
- Linear-time limited automata (Q5896091) (← links)
- Reversible pushdown transducers (Q5915557) (← links)
- Reversible pushdown transducers (Q5918384) (← links)
- Linear-time limited automata (Q5919709) (← links)
- Weight-reducing Turing machines (Q6040666) (← links)
- Weakly and Strongly Irreversible Regular Languages (Q6114869) (← links)
