Skip to content
GitLab
Projects Groups Snippets
  • /
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
    • Contribute to GitLab
  • Sign in
  • Spot Spot
  • Project information
    • Project information
    • Activity
    • Labels
    • Members
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributors
    • Graph
    • Compare
  • Issues 132
    • Issues 132
    • List
    • Boards
    • Service Desk
    • Milestones
  • Merge requests 1
    • Merge requests 1
  • CI/CD
    • CI/CD
    • Pipelines
    • Jobs
    • Schedules
  • Deployments
    • Deployments
    • Environments
    • Releases
  • Monitor
    • Monitor
    • Incidents
  • Analytics
    • Analytics
    • Value stream
    • CI/CD
    • Repository
  • Wiki
    • Wiki
  • Activity
  • Graph
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
Collapse sidebar
  • SpotSpot
  • SpotSpot
  • Issues
  • #72
Closed
Open
Issue created Mar 31, 2015 by Alexandre Duret-Lutz@adlOwner

Add an algorithm to transform Fin-less CNF acceptance into TGBA

Assume you have an automaton with Fin-less acceptance.

  • put the acceptance in CNF form: A1 & A2 & ... & An where each Ai has the form (Inf(i1)|Inf(i2)|...)
  • introduce one acceptance set Si per Ai, where Si is the union of i1, i2, ...
  • set the new acceptance to Inf(S1)&Inf(S2)&...&Inf(Sn).
Assignee
Assign to
Time tracking