Deterministic generalized automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 176770 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1142311 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 2044501 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Complexity results for multi-pebble automata and their logics
- Deterministic generalized automata
- Economy of description for single-valued transducers
- Finite automata and unary languages
- Minimal NFA Problems are Hard
- Minimization algorithms for sequential transducers
- THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
- The node-deletion problem for hereditary properties is NP-complete
Cited in
(11)- THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
- Deciding determinism of caterpillar expressions
- Algorithms for learning regular expressions from positive data
- Obtaining shorter regular expressions from finite-state automata
- Deterministic generalized automata
- The palindromization map
- Prefix-free regular languages and pattern matching
- scientific article; zbMATH DE number 6665218 (Why is no real title available?)
- scientific article; zbMATH DE number 3874624 (Why is no real title available?)
- Implementation and Application of Automata
- Generalizations of 1-deterministic regular languages
This page was built for publication: Deterministic generalized automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1285583)
