Pages that link to "Item:Q2271457"
From MaRDI portal
The following pages link to Determination of finite automata accepting subregular languages (Q2271457):
Displaying 26 items.
- State complexity of combined operations with two basic operations (Q441851) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- On external contextual grammars with subregular selection languages (Q443738) (← links)
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- Incomplete operational transition complexity of regular languages (Q498392) (← links)
- On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Closure properties of subregular languages under operations (Q2104140) (← links)
- Operations on subregular languages and nondeterministic state complexity (Q2112186) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- Networks of evolutionary processors: the power of subregular filters (Q2376983) (← links)
- Descriptional Complexity of Bounded Regular Languages (Q2829978) (← links)
- State Complexity of Prefix Distance of Subregular Languages (Q2829982) (← links)
- IN MEMORIAM CHANDRA KINTALA (Q2909177) (← links)
- THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES (Q2909186) (← links)
- Solutions to four open problems concerning controlled pure grammar systems (Q2921920) (← links)
- Aspects of Reversibility for Classical Automata (Q2944881) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q3451118) (← links)
- (Q4036600) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q4640043) (← links)
- Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
- Square on Ideal, Closed and Free Languages (Q5500682) (← links)
- On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata (Q5500690) (← links)
- Finite automata with undirected state graphs (Q5918649) (← links)
- Nondeterministic operational complexity in subregular languages (Q6093571) (← links)
- Remarks on context-free grammars with subregular control languages (Q6589853) (← links)
