Book ChapterDOI
Two-dimensional languages
Dora Giammarresi,Antonio Restivo +1 more
- pp 215-267
Reads0
Chats0
TLDR
The aim of this chapter is to generalize concepts and techniques of formal language theory to two dimensions.Abstract:
The aim of this chapter is to generalize concepts and techniques of formal language theory to two dimensions. Informally, a two-dimensional string is called a picture and is defined as a rectangular array of symbols taken from a finite alphabet. A two-dimensional language (or picture language) is a set of pictures.read more
Citations
More filters
Book ChapterDOI
Languages, automata, and logic
TL;DR: The subject of this chapter is the study of formal languages (mostly languages recognizable by finite automata) in the framework of mathematical logic.
Book
Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach
Bruno Courcelle,Joost Engelfriet +1 more
TL;DR: The author not only provides a thorough description of the theory, but also details its applications, on the one hand to the construction of graph algorithms, and the extension of formal language theory to finite graphs.
Journal Article
Regular model checking
TL;DR: Regular model checking is presented, a framework for algorithmic verification of infinite-state systems with, e.g., queues, stacks, integers, or a parameterized linear topology, by computation of the transitive closure of a transition relation.
Journal ArticleDOI
Algorithmics on SLP-compressed strings: A survey
TL;DR: Results on algorithmic problems on strings that are given in a compressed form via straight-line programs are surveyed and applications in combinatorial group theory and computational topology and to the solution of word equations are discussed.
Proceedings ArticleDOI
FlashRelate: extracting relational data from semi-structured spreadsheets using examples
TL;DR: This work introduces FlashRelate, a synthesis engine that lets ordinary users extract structured relational data from spreadsheets without programming, and demonstrates its usefulness addressing the widespread problem of data trapped in corporate and government formats.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book
An Introduction to Automata Theory
TL;DR: Great Aunt Eugenia and other automata Sundry machines Implementing finite automata Implementation and realization Behavioural equivalence, SP partitions and reduced machines
Book ChapterDOI
Weak Second-Order Arithmetic and Finite Automata
TL;DR: The formalism of regular expressions was introduced by S. C. Kleene to obtain the following basic theorems.
Book
Counter-Free Automata
Robert McNaughton,Seymour Papert +1 more
TL;DR: A particular class of finite-state automata, christened by the authors "counter-free," is shown here to behave like a good actor: it can drape itself so thoroughly in the notational guise and embed itself so deeply in the conceptual character of several quite different approaches to automata theory that on the surface it is hard to believe that all these roles are being assumed by the same class.
Book ChapterDOI
The Algebraic Theory of Context-Free Languages*
TL;DR: This chapter discusses the several classes of sentence-generating devices that are closely related, in various ways, to the grammars of both natural languages and artificial languages of various kinds.