Language membership problems for subregular classes
From MaRDI portal
No records found.
Cites work
- Automata for solid codes
- Closure properties of subregular languages under operations
- Closures in formal languages and Kuratowski's theorem
- Complexity of some problems from the theory of automata
- Computational Parallels between the Regular and Context-Free Languages
- Decision problems for convex languages
- Decision problems for subregular classes
- Descriptional and computational complexity of finite automata -- a survey
- Determination of finite automata accepting subregular languages
- Finite-automaton aperiodicity is PSPACE-complete
- scientific article; zbMATH DE number 3473324 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3293675 (Why is no real title available?)
- Linear Automaton Transformations
- On finite monoids having only trivial subgroups
- On tape-bounded complexity classes and multihead finite automata
- Operations on Permutation Automata
- Permutation automata
- Power-separating regular languages
- Quotient complexity of ideal languages
- Relationships between nondeterministic and deterministic tape complexities
- Roots of Star Events
- Structure and Complexity of Some Subregular Language Families
- The method of forced enumeration for nondeterministic automata
- Total Ordering Problem
- Various types of comet languages and their application in external contextual grammars
This page was built for publication: Language membership problems for subregular classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294924)
