Pages that link to "Item:Q1229100"

The following pages link to On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100):

Displaying 33 items.

• Regular languages with variables on graphs (Q418127) (← links)
• Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
• Decidable sentences of Church-Rosser congruences (Q593775) (← links)
• Boundedness testing for unambiguous context-free grammars (Q594604) (← links)
• The language intersection problem for non-recursive context-free grammars (Q596298) (← links)
• NFA reduction algorithms by means of regular inequalities (Q703569) (← links)
• On the computational complexity of bisimulation, redux (Q703845) (← links)
• Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete (Q761043) (← links)
• Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
• Bounded regular path queries in view-based data integration (Q989472) (← links)
• On derivation preservation (Q1058859) (← links)
• Testing for grammatical coverings (Q1080663) (← links)
• A survey of normal form covers for context-free grammars (Q1132639) (← links)
• Uniform data encodings (Q1134520) (← links)
• A new proof technique to establish equivalence of the original and the generated lambda-free CFG with linear increase in size (Q1161305) (← links)
• The covering problem for linear context-free grammars (Q1232301) (← links)
• From left-regular to Greibach normal form grammars (Q1259174) (← links)
• Algebraic rewritings for optimizing regular path queries. (Q1401283) (← links)
• Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
• Regular expression simplification (Q1404690) (← 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)
• Decidability of EDT0L structural equivalence (Q1605312) (← links)
• A theoretical framework for cardinality-based feature models: the semantics and computational aspects (Q1647962) (← links)
• The inclusion problem for some subclasses of context-free languages (Q1978515) (← links)
• Verifying polymer reaction networks using bisimulation (Q2003997) (← links)
• Learning residual alternating automata (Q2105462) (← links)
• Regular path queries under approximate semantics (Q2502162) (← links)
• ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA (Q3065610) (← links)
• Process Algebra and Model Checking (Q3176390) (← links)
• Note on the complexity of Las Vegas automata problems (Q3421911) (← links)
• Counting problems for parikh images (Q5111226) (← links)
• Words-to-Letters Valuations for Language Kleene Algebras with Variable Complements (Q6204135) (← links)