Pages that link to "Item:Q600253"
From MaRDI portal
The following pages link to On equations for regular languages, finite automata, and sequential networks (Q600253):
Displaying 50 items.
- On the role of complementation in implicit language equations and relations (Q386049) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Implicit language equations: existence and uniqueness of solutions (Q673088) (← links)
- Rewriting extended regular expressions (Q673635) (← links)
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- Decision problems for language equations (Q972384) (← links)
- A Rice-style theorem for parallel automata (Q1004287) (← links)
- On classes of tractable unrestricted regular expressions (Q1061498) (← links)
- Succinct representation of regular languages by Boolean automata. II (Q1068549) (← links)
- Generalized language equations with multiple solutions (Q1084871) (← links)
- Alternating automata on infinite trees (Q1098325) (← links)
- Succinct representation of regular sets using gotos and Boolean variables (Q1101207) (← links)
- On generalized language equations (Q1149791) (← links)
- Succinct representation of regular languages by Boolean automata (Q1151754) (← links)
- Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations (Q1201150) (← links)
- Language equations over a one-letter alphabet with union, concatenation and star: A complete solution (Q1331941) (← links)
- Unrestricted complementation in language equations over a one-letter alphabet (Q1334656) (← links)
- Decision procedures for inductive Boolean functions based on alternating automata (Q1399969) (← links)
- From bidirectionality to alternation. (Q1401248) (← 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)
- The commutation of finite sets: A challenging problem (Q1605327) (← links)
- On the closure properties of linear conjunctive languages. (Q1874415) (← links)
- Alternation in two-way finite automata (Q2029487) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Language equations (Q2074222) (← links)
- A symbolic decision procedure for symbolic alternating finite automata (Q2130584) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- Transformation from PLTL to automata via NFGs (Q2253959) (← links)
- Trace semantics via determinization (Q2341701) (← links)
- The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic (Q2423779) (← links)
- Model checking open systems with alternating projection temporal logic (Q2424878) (← links)
- Alternating automata and temporal logic normal forms (Q2488275) (← links)
- Automatic winning shifts (Q2672264) (← links)
- Kleene closure and state complexity (Q2956884) (← links)
- BOOLEAN FUZZY SETS (Q3401466) (← links)
- On the simplest centralizer of a language (Q3431440) (← links)
- Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (Q3617729) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Construction of a Deterministic<i>ω</i>-Automaton Using Derivatives (Q4265535) (← links)
- Domain mu-calculus (Q4460689) (← links)
- ON THE ROOT OF LANGUAGES (Q4786297) (← links)
- Equations and regular-like expressions for afa (Q4839734) (← links)
- Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
- Inferring program specifications in polynomial-time (Q5030195) (← links)
- Square on Deterministic, Alternating, and Boolean Finite Automata (Q5205045) (← links)
- The complexity of concatenation on deterministic and alternating finite automata (Q5223613) (← links)
