Automata construction

In automata theory, automata construction is an important mathematical technique used to demonstrate the existence of an automaton with a certain… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1987-2016
024619872016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
JFLAP is a powerful and popular educational software tool that allows students in Formal Languages and Automata courses to… (More)
  • figure 1
  • figure 2
  • table II
  • figure 6
  • figure 5
Is this relevant?
2011
2011
We present an active automata learning algorithm for Mealy state machines that directly constructs a state machine hypothesis… (More)
  • figure 1
  • figure 2
  • figure 4
  • table 1
  • figure 5
Is this relevant?
2007
2007
Automata over infinite words provide a powerful framework, which we can use to solve various decision problems. However, the… (More)
Is this relevant?
2006
2006
We present a tableau-based algorithm for obtaining a Büchi automaton from a formula in Dynamic Linear Time Temporal Logic (DLTL… (More)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
The language PSL [1] is a temporal logic standardized by the Accellera standards organization and currently undergoing the… (More)
Is this relevant?
2005
2005
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA… (More)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
Symbolic model checking has been found extremely efficient in the verification of hardware designs, and has been widely adopted… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
Industrial temporal languages like PSL/Sugar and ForSpec have augmented the language with Regular Expressions (REs). An RE… (More)
Is this relevant?
2004
2004
Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL… (More)
  • figure 2
  • table 1
Is this relevant?
1987
1987
Recent works on public key encryption for secure network communication [7] have brought back the following problem : given a… (More)
Is this relevant?