Pages that link to "Item:Q1349896"
From MaRDI portal
The following pages link to Complexity results for two-way and multi-pebble automata and their logics (Q1349896):
Displaying 17 items.
- Two-way pebble transducers for partial functions and their composition (Q748432) (← links)
- Complementing deterministic tree-walking automata (Q845667) (← links)
- A Rice-style theorem for parallel automata (Q1004287) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- Typechecking for XML transformers (Q1394797) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- Query automata over finite trees (Q1607226) (← links)
- Attribute grammars for unranked trees as a query language for structured documents (Q1776378) (← links)
- Alternation and bounded concurrency are reverse equivalent. (Q1854297) (← links)
- Alternation in two-way finite automata (Q2029487) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- The equivalence of pebbles and sensing heads for finite automata (Q5055952) (← links)
- (Q5091268) (← links)
- Pebble-depth (Q6589837) (← links)
- Transducers of polynomial growth (Q6649429) (← links)