Login / Signup

State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet.

Michal KuncAlexander Okhotin
Published in: DCFS (2011)
Keyphrases
  • deterministic finite automata
  • database
  • information systems
  • decision problems
  • regular expressions
  • databases
  • pairwise
  • data model
  • state space
  • computational cost
  • data sources
  • worst case
  • domain specific