Adding nesting structure to words
From MaRDI portal
Publication:3452213
DOI10.1145/1516512.1516518zbMATH Open1325.68138OpenAlexW2131886132WikidataQ29396124 ScholiaQ29396124MaRDI QIDQ3452213FDOQ3452213
Authors: Parthasarathy Madhusudan, Rajeev Alur 
Publication date: 11 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1516512.1516518
Recommendations
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (only showing first 100 items - show all)
- Additive number theory via automata theory
- Weighted operator precedence languages
- Languages of Nested Trees
- Generalized rewrite theories, coherence completion, and symbolic methods
- Deciding path size of nondeterministic (and input-driven) pushdown automata
- Model Checking: From Tools to Theory
- Model-checking structured context-free languages
- Nested interpolants
- Nondeterministic state complexity of nested word automata
- Context-free timed formalisms: robust automata and linear temporal logics
- Title not available (Why is that?)
- When input-driven pushdown automata meet reversiblity
- Which XML schemas are streaming bounded repairable?
- Digging input-driven pushdown automata
- State complexity of the concatenation of regular tree languages
- Colored Nested Words
- Queries on XML streams with bounded delay and concurrency
- Weighted automata and logics on infinite graphs
- First-Order and Temporal Logics for Nested Words
- Edit distance neighbourhoods of input-driven pushdown automata
- Model checking procedural programs
- Sums of Palindromes: an Approach via Automata
- An automaton over data words that captures EMSO logic
- Shifts of \(k\)-nested sequences
- Toward a theory of input-driven locally parsable languages
- Operator precedence temporal logic and model checking
- Descriptional complexity of unambiguous input-driven pushdown automata
- Rewriting systems over nested data words
- Sublinear DTD validity
- Linking theorems for tree transducers
- State complexity of operations on input-driven pushdown automata
- Sofic-Dyck shifts
- 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
- Temporal logics for concurrent recursive programs: satisfiability and model checking
- Jumping finite automata
- Operational state complexity of nested word automata
- Operator precedence and the visibly pushdown property
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Locally chain-parsable languages
- On the power of pushing or stationary moves for input-driven pushdown automata
- Symbolic weighted language models, quantitative parsing and automated music transcription
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- Interprocedural reachability for flat integer programs
- Bounded Parikh automata
- Descriptional complexity of input-driven pushdown automata
- Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
- Limitations of lower bound methods for deterministic nested word automata
- Adding Nesting Structure to Words
- Shuffle Expressions and Words with Nested Data
- Logic for \(\omega\)-pushdown automata
- Weighted operator precedence languages
- Weighted automata
- Beyond operator-precedence grammars and languages
- Multi-matching nested relations
- Visibly pushdown transducers with look-ahead
- Queue Automata: Foundations and Developments
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- Realizability of concurrent recursive programs
- Title not available (Why is that?)
- On the path-width of integer linear programming
- Visibly pushdown modular games
- Visibly pushdown transducers
- Generalizing input-driven languages: theoretical and practical benefits
- Precedence automata and languages
- First-order logic definability of free languages
- Higher-order operator precedence languages
- Synchronizing automata over nested words
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
- Exploring non-regular extensions of propositional dynamic logic with description-logics features
- Title not available (Why is that?)
- Extending Wagner's hierarchy to deterministic visibly pushdown automata
- Edit distance neighbourhoods of input-driven pushdown automata
- Input-driven pushdown automata for edit distance neighborhood
- State complexity of the quotient operation on input-driven pushdown automata
- A closer look at the expressive power of logics based on word equations
- Automated program verification
- Trimming visibly pushdown automata
- Input-driven double-head pushdown automata
- On the power of pushing or stationary moves for input-driven pushdown automata
- The (nested) word problem
- A survey of model learning techniques for recurrent neural networks
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Theoretical computer science: computational complexity
- Automata and Logics for Concurrent Systems: Five Models in Five Pages
- Synchronizing deterministic push-down automata can be really hard
- A Branching Time Variant of CaRet
- Sweeping input-driven pushdown automata
- Emptiness of ordered multi-pushdown automata is 2ETIME-complete
- Schema-based automata determinization
- The complexity of model checking multi-stack systems
- Deciding proper conjugacy of classes of one-sided finite-type-Dyck shifts
- Games for active XML revisited
- Streamability of nested word transductions
- On exteriority notions in book embeddings and treewidth
- Visibly pushdown transducers with well-nested outputs
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)
