- Succinct representation of regular languages by boolean automata II
1985/01/01 by Ernst L. Leiss, Ernst Leiss · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Algorithm #Automata theory #Automaton #Boolean function #Büchi automaton #Combinatorics #Computer science #DNA and Biological Computing #Deterministic automaton #Deterministic finite automaton #Discrete mathematics #Finite-state machine #Formal Methods in Verification #Mathematics #Mobile automaton #Nondeterministic algorithm #Nondeterministic finite automaton #Quantum finite automata #Regular language #Succinctness #Theoretical computer science #Timed automaton #Two-way deterministic finite automaton #semigroups and automata theory #ω-automaton
- Succinct representation of regular languages by boolean automata
1981/01/01 by Ernst L. Leiss, Ernst Leiss · 3 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Algebra over a field #Algorithm #Automata theory #Automaton #Boolean expression #Boolean function #Büchi automaton #Combinatorics #Computer science #DFA minimization #DNA and Biological Computing #Deterministic automaton #Deterministic finite automaton #Discrete mathematics #Finite-state machine #Formal Methods in Verification #Mathematics #Nested word #Nondeterministic algorithm #Nondeterministic finite automaton #Product term #Pure mathematics #Quantum finite automata #Regular language #Succinctness #Theoretical computer science #Two-element Boolean algebra #Two-way deterministic finite automaton #semigroups and automata theory #ω-automaton