Boolean Variables in Regular Expressions and Finite Automata.

Abstract

This paper considers questions of succinctness of representation of regular sets by regular expressions and finite automata which may contain special instructions for setting and testing auxiliary Boolean variables. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1980
Accession Number
ADA092666

Entities

People

  • Karl R. Abrahamson

Organizations

  • University of Washington

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Alphabets
  • Automata
  • Bits
  • Computer Science
  • Computers
  • Contracts
  • Finite Alphabet
  • Language
  • Machines
  • Military Research
  • Numbers
  • Program Management
  • Sequences
  • Side Effects
  • Simulations
  • Theorems
  • Transitions

Fields of Study

  • Mathematics

Readers

  • Computational Linguistics
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)