Pages that link to "Item:Q1151754"
From MaRDI portal
The following pages link to Succinct representation of regular languages by Boolean automata (Q1151754):
Displaying 50 items.
- Reversal of binary regular languages (Q443743) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- On the state complexity of reversals of regular languages (Q596099) (← links)
- Concatenation of regular languages and descriptional complexity (Q639851) (← links)
- Partial orders on words, minimal elements of regular languages, and state complexity (Q688156) (← links)
- On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages (Q703507) (← links)
- An approximation algorithm for state minimization in 2-MDFAs (Q855011) (← links)
- State complexity of inversion operations (Q896671) (← links)
- Prefix-free languages: left and right quotient and reversal (Q896681) (← links)
- State complexity of basic operations on suffix-free regular languages (Q1029324) (← links)
- Complexity and succinctness issues for linear-time hybrid logics (Q1044839) (← links)
- On classes of tractable unrestricted regular expressions (Q1061498) (← links)
- Succinct representation of regular languages by Boolean automata. II (Q1068549) (← links)
- Intersection and union of regular languages and state complexity (Q1199879) (← links)
- The state complexities of some basic operations on regular languages (Q1318694) (← links)
- Generalized acceptance, succinctness and supernondeterministic finite automata. (Q1426171) (← links)
- Alternating finite automata and star-free languages (Q1575674) (← links)
- Efficient implementation of regular languages using reversed alternating finite automata (Q1575901) (← links)
- Implementing automata. Selected papers from the 2nd international workshop, WIA '97, Univ. of Western Ontario, London, Ontario, Canada, September 18--20, 1997 (Q1586200) (← links)
- Inferring regular languages and \(\omega\)-languages (Q1648037) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← links)
- Complementing unary nondeterministic automata (Q1763723) (← links)
- Alternation in two-way finite automata (Q2029487) (← links)
- On degrees of ambiguity for Büchi tree automata (Q2051784) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Performing regular operations with 1-limited automata (Q2164004) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- Complexity of suffix-free regular languages (Q2402364) (← links)
- The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic (Q2423779) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- Self-Verifying Finite Automata and Descriptional Complexity (Q2829967) (← links)
- Descriptional Complexity of Bounded Regular Languages (Q2829978) (← links)
- COMPLEXITY IN UNION-FREE REGULAR LANGUAGES (Q2909101) (← links)
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (Q2914712) (← links)
- Counting with Probabilistic and Ultrametric Finite Automata (Q2944874) (← links)
- Complexity of Suffix-Free Regular Languages (Q2947876) (← links)
- Concise representations of regular languages by degree and probabilistic finite automata (Q3142004) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION (Q3503086) (← links)
- On the State Complexity of Operations on Two-Way Finite Automata (Q3533031) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- State Complexity of Combined Operations for Prefix-Free Regular Languages (Q3618598) (← links)
- Domain mu-calculus (Q4460689) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
- (Q5155680) (← links)
