Determination of finite automata accepting subregular languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3473324 (Why is no real title available?)
- scientific article; zbMATH DE number 1156489 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3293675 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- Characterizations of locally testable events
- Finite automata and unary languages
- Locally testable languages
- Lower Bound of the Number of Threshold Functions
- Multiple-entry finite automata
- On Decompositions of Regular Events
- On NFAs where all states are final, initial, or both
- On finite monoids having only trivial subgroups
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- Power-separating regular languages
- Roots of Star Events
- The Theory of Definite Automata
- Ultimate-Definite and Symmetric-Definite Events and Automata
Cited in
(33)- State complexity of combined operations with two basic operations
- Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language \(R \) with \(R_{1}\subseteq R\subseteq R_{2}\) for given regular languages \(R_{1},R_{2}\).
- scientific article; zbMATH DE number 176770 (Why is no real title available?)
- Operations on subregular languages and nondeterministic state complexity
- Solutions to four open problems concerning controlled pure grammar systems
- Networks of evolutionary processors: the power of subregular filters
- Remarks on context-free grammars with subregular control languages
- Aspects of reversibility for classical automata
- scientific article; zbMATH DE number 4080912 (Why is no real title available?)
- Descriptional complexity of bounded regular languages
- On the descriptional complexity of finite automata with modified acceptance conditions
- Nondeterministic state complexity of star-free languages
- On external contextual grammars with subregular selection languages
- On a structural property in the state complexity of projected regular languages
- Square on ideal, closed and free languages
- Nondeterministic state complexity of star-free languages
- Closure properties of subregular languages under operations
- Descriptional complexity of bounded regular languages
- State complexity of prefix distance of subregular languages
- State complexity of neighbourhoods and approximate pattern matching
- Nondeterministic complexity in subclasses of convex languages
- In memoriam Chandra Kintala
- Operational complexity in subregular classes
- Finite automata with undirected state graphs
- Nondeterministic operational complexity in subregular languages
- State complexity of neighbourhoods and approximate pattern matching
- Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
- Incomplete operational transition complexity of regular languages
- Descriptional complexity of regular languages
- On the descriptional complexity of stateless deterministic ordered restarting automata
- On some decision problems for stateless deterministic ordered restarting automata
- The magic number problem for subregular language families
- On the power of subroutines for finite state machines
This page was built for publication: Determination of finite automata accepting subregular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2271457)
