Adding nesting structure to words
From MaRDI portal
Publication:3452213
Recommendations
Cited in
(only showing first 100 items - show all)- scientific article; zbMATH DE number 7447741 (Why is no real title available?)
- Visibly pushdown transducers
- Generalizing input-driven languages: theoretical and practical benefits
- Communicating finite-state machines and two-variable logic
- Precedence automata and languages
- First-order logic definability of free languages
- Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features
- Input-Driven Double-Head Pushdown Automata
- Higher-order operator precedence languages
- Minimization of visibly pushdown automata using partial Max-SAT
- Synchronizing automata over nested words
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Additive number theory via automata theory
- Generalized rewrite theories, coherence completion, and symbolic methods
- Deciding path size of nondeterministic (and input-driven) pushdown automata
- Weighted operator precedence languages
- Languages of Nested Trees
- Model Checking: From Tools to Theory
- Model-checking structured context-free languages
- Nondeterministic state complexity of nested word automata
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
- Nested interpolants
- Exploring non-regular extensions of propositional dynamic logic with description-logics features
- Context-free timed formalisms: robust automata and linear temporal logics
- Which XML schemas are streaming bounded repairable?
- When input-driven pushdown automata meet reversiblity
- scientific article; zbMATH DE number 7439739 (Why is no real title available?)
- scientific article; zbMATH DE number 7577575 (Why is no real title available?)
- Digging input-driven pushdown automata
- State complexity of the concatenation of regular tree languages
- Extending Wagner's hierarchy to deterministic visibly pushdown automata
- Queries on XML streams with bounded delay and concurrency
- Edit distance neighbourhoods of input-driven pushdown automata
- Input-driven pushdown automata for edit distance neighborhood
- Colored Nested Words
- State complexity of the quotient operation on input-driven pushdown automata
- Weighted automata and logics on infinite graphs
- Automated program verification
- A closer look at the expressive power of logics based on word equations
- First-Order and Temporal Logics for Nested Words
- Trimming visibly pushdown automata
- Input-driven double-head pushdown automata
- Edit distance neighbourhoods of input-driven pushdown automata
- On the power of pushing or stationary moves for input-driven pushdown automata
- The (nested) word problem
- Model checking procedural programs
- Sums of Palindromes: an Approach via Automata
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- An automaton over data words that captures EMSO logic
- A survey of model learning techniques for recurrent neural networks
- Shifts of \(k\)-nested sequences
- Toward a theory of input-driven locally parsable languages
- Descriptional complexity of unambiguous input-driven pushdown automata
- Operator precedence temporal logic and model checking
- Rewriting systems over nested data words
- Theoretical computer science: computational complexity
- Sofic-Dyck shifts
- Automata and Logics for Concurrent Systems: Five Models in Five Pages
- Sublinear DTD validity
- Linking theorems for tree transducers
- State complexity of operations on input-driven pushdown automata
- Early nested word automata for XPath query answering on XML streams
- On the determinization of event-clock input-driven pushdown automata
- Colored nested words
- Visibly rational expressions
- Streamable fragments of forward XPath
- Synchronizing deterministic push-down automata can be really hard
- A Branching Time Variant of CaRet
- Temporal logics for concurrent recursive programs: satisfiability and model checking
- Jumping finite automata
- Operator precedence and the visibly pushdown property
- Operational state complexity of nested word automata
- Sweeping input-driven pushdown automata
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- On the power of pushing or stationary moves for input-driven pushdown automata
- Symbolic weighted language models, quantitative parsing and automated music transcription
- Locally chain-parsable languages
- Interprocedural reachability for flat integer programs
- Bounded Parikh automata
- Descriptional complexity of input-driven pushdown automata
- Limitations of lower bound methods for deterministic nested word automata
- Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
- Emptiness of ordered multi-pushdown automata is 2ETIME-complete
- The complexity of model checking multi-stack systems
- Adding Nesting Structure to Words
- Shuffle Expressions and Words with Nested Data
- Logic for \(\omega\)-pushdown automata
- Weighted operator precedence languages
- Weighted automata
- Schema-based automata determinization
- Deciding proper conjugacy of classes of one-sided finite-type-Dyck shifts
- Games for active XML revisited
- Beyond operator-precedence grammars and languages
- On exteriority notions in book embeddings and treewidth
- Multi-matching nested relations
- Streamability of nested word transductions
- Visibly pushdown transducers with look-ahead
- Visibly pushdown transducers with well-nested outputs
- Ramsey-based inclusion checking for visibly pushdown automata
This page was built for publication: Adding nesting structure to words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452213)
