Automata for Branching and Layered Temporal Structures: An by Gabriele Puppis

By Gabriele Puppis

Since 2002, FoLLI awards an annual prize for a great dissertation within the fields of good judgment, Language, and data. This publication relies at the Ph.D. thesis of Gabriele Puppis, who used to be the winner of the E.W. Beth dissertation award for 2007.

Puppis' thesis makes a speciality of common sense and Computation and, extra in particular, on automata-based decidability innovations for time granularity and on a brand new strategy for figuring out Monadic moment Order theories of bushes. the consequences provided characterize an important step in the direction of a greater knowing of the adjustments in granularity degrees that people make so simply in cognition of time, house, and different phenomena, while their logical and computational constitution poses tough conceptual and computational challenges.

Show description

Read Online or Download Automata for Branching and Layered Temporal Structures: An Investigation into Regularities of Infinite Transition Systems PDF

Similar computers books

Complex sciences, 1 conf

This booklet constitutes the completely refereed post-conference court cases of the 1st overseas convention on complicated Sciences, advanced 2009, held in Shanghai, China, in February 2009. The 227 revised complete papers provided including 23 papers from 5 collated workshops (COART, ComplexCCS, ComplexEN, MANDYN, SPA) have been conscientiously reviewed and chosen.

CSL '87: 1st Workshop on Computer Science Logic Karlsruhe, FRG, October 12–16, 1987 Proceedings

This quantity comprises the papers that have been provided to the workshop "Computer-Science common sense" held in Karlsruhe on October 12-16, 1987. commonly common sense, or extra particularly, Mathematical good judgment splits into numerous subareas: Set thought, evidence thought, Recursion conception, and version conception. furthermore there's what occasionally is termed Philosophical common sense which offers with themes like nonclassical logics and which for ancient purposes has been built normally at philosphical departments instead of at arithmetic associations.

Graph-Theoretic Concepts in Computer Science: 16th International Workshop WG '90 Berlin, Germany, June 20–22, 1990 Proceedings

This quantity supplies the court cases of WG '90, the sixteenth in a sequence of workshops. the purpose of the workshop sequence is to give a contribution to integration in desktop technology through using graph-theoretic innovations. The workshops are strange in that they mix theoretical points with perform and purposes. the quantity is prepared into sections on: - Graph algorithms and complexity, - VLSI format, - Multiprocessor platforms and concurrency, - Computational geometry, - Graphs, languages and databases, - Graph grammars.

Sams Teach Yourself Adobe(R) Illustrator(R) 10 in 24 Hours

This step by step educational makes use of a pleasant, conversational, and non-condescending method of train readers the fundamentals of Adobe Illustrator. The book's tone is considered one of a instructor sitting with you explaining the best way to use this system. With examples from either the Macintosh and home windows structures, Sams educate your self Illustrator in 24 Hours covers the next themes and extra: the interface, instruments, and palettes; atmosphere personal tastes; drawing and modifying items; layers; operating with choices; Bezier paths; and mask, modifications and colour.

Additional info for Automata for Branching and Layered Temporal Structures: An Investigation into Regularities of Infinite Transition Systems

Example text

3 Compact and Tractable Representations 41 unique (up to isomorphism) among all equivalent NCSSA, as it happens, for instance, with the case of deterministic finite automata. Hereafter, we denote by n(A) the number of states of an NCCSA A. , by partitioning the state space or by exploiting characterizations of recognizable words in terms of suitable expressions. In the following, we tackle both the complexity optimization problem and the state optimization problem by using dynamic programming, namely, by computing optimal NCSSA starting from smaller (optimal) ones in a bottom-up fashion.

As a matter of fact, this also proves that any RCSSA can be effectively translated into an equivalent SSA. For the sake of completeness, below we explicitly describe the translation from RCSSA to SSA. From such a result and from the fact that the equivalence problem for SSA is solvable in linear time, we have that the equivalence problem for RCSSA is in EXPTIME. Proposition 2. Any RCSSA A can be effectively translated into an equivalent SSA A having size at most exponential in the size of A (note that the size of A comprises the size of the binary expansion of every constant that appears inside a guard of a secondary transition of A).

The (unique) infinite word recognized by A is given by the sequence ↓3 ρ = ↓3 ρ(1) ↓3 ρ(2) ↓3 ρ(3) .... 5 depicts a CSSA representing the time granularity BusinessWeek. Such an automaton uses one counter i, which is initialized to 0. , i ← i + 1); the guards of the secondary transitions are specified as additional annotations, having the form of constraints like i = 4, of the corresponding arrows. 6, which depicts a CSSA representing the time granularity Month over the temporal domain of days. 22 2 Word Automata and Time Granularities j mod 12 = 0 i ← 0; j ← 0; k ← k + 1 s0 j ← i mod 26 = 0 s1 k mod 400 = 200 ∧ k mod 400 = 300 s2 s6 j mod 12 = 10 0; k mod 4 = 0 ∧ k mod 400 = 100 ∧ j mod 12 = 8 ∧ ← 1 s8 j mod 12 = 5 ∧ i + j mod 12 = 1 s5 j j mod 12 = 3 ∧ s7 i ← 0; j ← j + 1 s3 s4 i←i+1 i ← 0; j ← j + 1 i ← 0; j ← j + 1 Fig.

Download PDF sample

Rated 4.91 of 5 – based on 37 votes