Pages that link to "Item:Q3698326"
From MaRDI portal
The following pages link to On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata (Q3698326):
Displayed 45 items.
- Foundations of Boolean stream runtime verification (Q278752) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- The tractability frontier for NFA minimization (Q414869) (← links)
- Unambiguous finite automata over a unary alphabet (Q418147) (← links)
- Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata (Q436610) (← links)
- Ambiguity and communication (Q537915) (← links)
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
- Weak minimization of DFA -- an algorithm and applications (Q703502) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- Effective entropies and data compression (Q751832) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- On the degree of ambiguity of finite automata (Q1177168) (← links)
- The parallel complexity of finite-state automata problems (Q1186807) (← links)
- Transforming a single-valued transducer into a Mealy machine (Q1267709) (← links)
- On path equivalence of nondeterministic finite automata (Q1351166) (← links)
- A probabilistic approach to navigation in Hypertext (Q1818980) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- The inclusion problem for some subclasses of context-free languages (Q1978515) (← links)
- On degrees of ambiguity for Büchi tree automata (Q2051784) (← links)
- Automata on infinite trees (Q2074210) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q2147688) (← links)
- Ambiguity and structural ambiguity of symmetric difference NFAs (Q2453538) (← links)
- Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- IN MEMORIAM CHANDRA KINTALA (Q2909177) (← links)
- ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA (Q3065610) (← links)
- Concise representations of regular languages by degree and probabilistic finite automata (Q3142004) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Bounded Delay and Concurrency for Earliest Query Answering (Q3618594) (← links)
- A note on finite-valued and finitely ambiguous transducers (Q3968472) (← links)
- Deterministic realization of nondeterministic computations with a low measure of nondeterminism (Q4007372) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (Q5002825) (← links)
- (Q5002827) (← links)
- On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
- Universality Problem for Unambiguous VASS (Q5089303) (← links)
- Deciding equivalence of finite tree automata (Q5096180) (← links)
- (Q5155680) (← links)
- Unambiguity in Automata Theory (Q5500675) (← links)
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY (Q5704377) (← links)
- A Pattern Logic for Automata with Outputs (Q5859645) (← links)
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)