Showing 2018Show all
3 papers · 1 filter
cs.FL2018
Deque languages, automata and planar graphs
Stefano Crespi Reghizzi, Pierluigi San Pietro
The memory of a deque (double ended queue) automaton is more general than a queue or two stacks; to avoid overgeneralization, we consider quasi-real-time operation. Normal forms of…
cs.LO2018
Verifying MITL formulae on Timed Automata considering a Continuous Time Semantics
Claudio Menghi, Marcello Bersani, Matteo Rossi +1
Timed Automata (TA) is de facto a standard modelling formalism to represent systems when the interest is the analysis of their behaviour as time progresses. This modelling formalis…
cs.FL2018
Non-erasing Chomsky-Sch{ü}tzenberger theorem with grammar-independent alphabet
Stefano Crespi Reghizzi, Pierluigi San Pietro
The famous theorem by Chomsky and Schützenberger (CST) says that every context-free language over an alphabet is representable as , where is a Dyck languag…