9.8k citations
- Tata Institute of Fundamental ResearchIN44 papers
- Pennsylvania State UniversityUS37 papers
- Cardiff UniversityGB36 papers
- Max Planck Institute for Gravitational PhysicsDE34 papers
- California Institute of TechnologyUS33 papers
- Centre National de la Recherche ScientifiqueFR33 papers
- Georgia Institute of TechnologyUS33 papers
- Institute for Plasma ResearchIN33 papers
- Leibniz University HannoverDE33 papers
- Montclair State UniversityUS33 papers
- Syracuse UniversityUS33 papers
- Université Paris CitéFR33 papers
5 papers · 1 filter
Bounded treewidth, multiple context-free grammars, and downward closures
C. Aiswarya, Pascal Baumann, Prakash Saivasan +2
The reachability problem in multi-pushdown automata (MPDA) has many applications in static analysis of recursive programs. An example is safety verification of multi-threaded recur…
Deterministic Suffix-reading Automata
R Keerthan, B Srivathsan, R Venkatesh +1
We introduce deterministic suffix-reading automata (DSA), a new automaton model over finite words. Transitions in a DSA are labeled with words. From a state, a DSA triggers an outg…
Infinitude of Primes Using Formal Language Theory
Aalok Thakkar
Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages…
Logics for Reversible Regular Languages and Semigroups with Involution
Paul Gastin, Amaldev Manuel, R. Govind
We present MSO and FO logics with predicates `between' and `neighbour' that characterise various fragments of the class of regular languages that are closed under the reverse opera…
Fast algorithms for handling diagonal constraints in timed automata
Paul Gastin, Sayan Mukherjee, B Srivathsan
A popular method for solving reachability in timed automata proceeds by enumerating reachable sets of valuations represented as zones. A naïve enumeration of zones does not termina…