Back to Results
First PageMeta Content
Formal languages / Computer science / Deterministic pushdown automaton / Ω-automaton / Pushdown automaton / Omega language / Nondeterministic finite automaton / Context-free language / Regular language / Automata theory / Theoretical computer science / Models of computation


Regularity Problems for Weak Pushdown ω-Automata and Games Extended VersionChristof L¨oding and Stefan Repke⋆ Lehrstuhl f¨ ur Informatik 7, RWTH Aachen, Germany
Add to Reading List

Document Date: 2012-09-03 08:07:06

Open Document

File Size: 436,66 KB

Share Result on Facebook

Company

DFG Research Training Group / Discrete-Continuous Systems / /

/

IndustryTerm

known algorithms / minimization algorithm / /

Person

Stefan Repke Automata / Stefan Repke / Stefan Repke Regularity / Equivalence Testing / /

Position

corresponding player / winning player / coB / A. Player / Player / otherwise Player / /

ProgrammingLanguage

XML / /

Technology

DTD / XML / AV / document type definition / minimization algorithm / finite state machine / /

SocialTag