Finite State Automata, Regular Languages and Predicate Calculus

Finite-State Technology

The Oxford Handbook of Computational Linguistics 2nd edition ◽

10.1093/oxfordhb/9780199573691.013.39 ◽

2018 ◽

Author(s):

Mans Hulden

Keyword(s):

Natural Language Processing ◽

Natural Language ◽

Computational Linguistics ◽

Language Processing ◽

Finite State Machines ◽

Regular Languages ◽

Finite State Automata ◽

State Machines ◽

Computational Phonology ◽

Finite State

Finite-state machines—automata and transducers—are ubiquitous in natural-language processing and computational linguistics. This chapter introduces the fundamentals of finite-state automata and transducers, both probabilistic and non-probabilistic, illustrating the technology with example applications and common usage. It also covers the construction of transducers, which correspond to regular relations, and automata, which correspond to regular languages. The technologies introduced are widely employed in natural language processing, computational phonology and morphology in particular, and this is illustrated through common practical use cases.

Download Full-text

Tricolor automata

Proceedings of Balisage: The Markup Conference 2015 ◽

10.4242/balisagevol15.sperberg-mcqueen01 ◽

2015 ◽

Author(s):

C. M. Sperberg-McQueen

Keyword(s):

Regular Languages ◽

The Other ◽

Finite State Automata ◽

Simple Application ◽

Finite State

Tricolor automata are extensions of finite state automata, intended for the comparison of two regular languages; states and arcs in the automaton are colored to indicate whether they are peculiar to one language or the other, or common to both. Their design represents a simple application to practical purposes of ideas derived from the work of Glushkov and Brzozowski. Examples are given to show how tricolor automata can be used to visualize the intersection, union, and set difference of two languages, and algorithms for constructing them are given.

Download Full-text

A Transformation-Based Approach to Implication of GSTE Assertion Graphs

Journal of Applied Mathematics ◽

10.1155/2013/709071 ◽

2013 ◽

Vol 2013 ◽

pp. 1-7

Author(s):

Guowu Yang ◽

William N. N. Hung ◽

Xiaoyu Song ◽

Wensheng Guo

Keyword(s):

Model Checking ◽

Directed Graphs ◽

Classical Model ◽

Regular Languages ◽

Finite State Automaton ◽

Finite State Automata ◽

Symbolic Trajectory Evaluation ◽

Finite State ◽

Symbolic Trajectory ◽

Language Containment

Generalized symbolic trajectory evaluation (GSTE) is a model checking approach and has successfully demonstrated its powerful capacity in formal verification of VLSI systems. GSTE is an extension of symbolic trajectory evaluation (STE) to the model checking ofω-regular properties. It is an alternative to classical model checking algorithms where properties are specified as finite-state automata. In GSTE, properties are specified as assertion graphs, which are labeled directed graphs where each edge is labeled with two labeling functions: antecedent and consequent. In this paper, we show the complement relation between GSTE assertion graphs and finite-state automata with the expressiveness of regular languages andω-regular languages. We present an algorithm that transforms a GSTE assertion graph to a finite-state automaton and vice versa. By applying this algorithm, we transform the problem of GSTE assertion graphs implication to the problem of automata language containment. We demonstrate our approach with its application to verification of an FIFO circuit.

Download Full-text