The following pages link to Adding nesting structure to words (Q3452213):
Displayed 50 items.
- Which XML schemas are streaming bounded repairable? (Q269345) (← links)
- State complexity of the concatenation of regular tree languages (Q418803) (← links)
- Temporal logics for concurrent recursive programs: satisfiability and model checking (Q472794) (← links)
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity (Q477204) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Visibly pushdown modular games (Q515657) (← links)
- On the path-width of integer linear programming (Q515665) (← links)
- Weighted automata and logics for infinite nested words (Q515684) (← links)
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- Shifts of \(k\)-nested sequences (Q728261) (← links)
- Toward a theory of input-driven locally parsable languages (Q728273) (← links)
- Sofic-Dyck shifts (Q897881) (← links)
- Realizability of concurrent recursive programs (Q1620953) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Generalizing input-driven languages: theoretical and practical benefits (Q1706605) (← links)
- Operator precedence and the visibly pushdown property (Q1757840) (← links)
- Additive number theory via automata theory (Q1987517) (← links)
- Beyond operator-precedence grammars and languages (Q2186819) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- Operator precedence temporal logic and model checking (Q2215961) (← links)
- Multi-matching nested relations (Q2220863) (← links)
- Nondeterministic state complexity of nested word automata (Q2271435) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- On exteriority notions in book embeddings and treewidth (Q2297721) (← links)
- Trimming visibly pushdown automata (Q2344743) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- Early nested word automata for XPath query answering on XML streams (Q2344752) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- Games for active XML revisited (Q2402614) (← links)
- Visibly rational expressions (Q2453980) (← links)
- Linking theorems for tree transducers (Q2628796) (← links)
- The (nested) word problem (Q2630345) (← links)
- Automated Program Verification (Q2799160) (← links)
- Sublinear DTD Validity (Q2799222) (← links)
- Synchronizing Automata over Nested Words (Q2811343) (← links)
- Weighted Automata and Logics on Infinite Graphs (Q2817384) (← links)
- BOUNDED PARIKH AUTOMATA (Q2841977) (← links)
- Visibly Pushdown Transducers with Look-Ahead (Q2891373) (← links)
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization (Q2944566) (← links)
- Locally Chain-Parsable Languages (Q2946332) (← links)
- Automata and Logics for Concurrent Systems: Five Models in Five Pages (Q2947404) (← links)
- Interprocedural Reachability for Flat Integer Programs (Q2947875) (← links)
- When input-driven pushdown automata meet reversiblity (Q2969982) (← links)
- Precedence Automata and Languages (Q3007634) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Model Checking Procedural Programs (Q3176375) (← links)