Pages that link to "Item:Q4506483"
From MaRDI portal
The following pages link to Introduction to automata theory, languages, and computation. (Q4506483):
Displaying 50 items.
- On the Hopcroft's minimization technique for DFA and DFCA (Q1019723) (← links)
- Compositionally progressive solutions of synchronous FSM equations (Q1020554) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- A characterization of regular circular languages generated by marked splicing systems (Q1034615) (← links)
- Computational bounds on polynomial differential equations (Q1036531) (← links)
- On regular tree languages and deterministic pushdown automata (Q1037619) (← links)
- Extracting symbolic knowledge from recurrent neural networks -- a fuzzy logic approach (Q1037850) (← links)
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata (Q1037929) (← links)
- Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic (Q1037930) (← links)
- Closure and decidability properties of some language classes with respect to ciliate bio-operations. (Q1426436) (← links)
- A language measure for supervisory control (Q1431960) (← links)
- Algorithmic complexity of recursive and inductive algorithms (Q1434367) (← links)
- Experience, generations, and limits in machine learning (Q1434369) (← links)
- Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets (Q1615413) (← links)
- Combining Benders decomposition and column generation for multi-activity tour scheduling (Q1652589) (← links)
- Passive testing with asynchronous communications and timestamps (Q1656880) (← links)
- Regular language representations in the constructive type theory of Coq (Q1663246) (← links)
- Growth in higher Baumslag-Solitar groups (Q1663769) (← links)
- Regular patterns, regular languages and context-free languages (Q1675877) (← links)
- Weak call-by-value lambda calculus as a model of computation in Coq (Q1687735) (← links)
- Inductive synthesis of cover-grammars with the help of ant colony optimization (Q1692068) (← links)
- Semiautomatic structures (Q1694004) (← links)
- Disturbance decoupling in nonlinear hybrid systems (Q1698442) (← links)
- On the gap between separating words and separating their reversals (Q1698731) (← links)
- Coding tree languages based on lattice-valued logic (Q1701899) (← links)
- Model approach to grammatical evolution: deep-structured analyzing of model and representation (Q1701981) (← links)
- Separating codes and traffic monitoring (Q1704860) (← links)
- Deriving generic bounds for time-series constraints based on regular expressions characteristics (Q1706597) (← links)
- On the adoption of abductive reasoning for time series interpretation (Q1711884) (← links)
- Negotiation as concurrency primitive (Q1731828) (← links)
- An adaptive subdivision method for root finding of univariate polynomials (Q1736361) (← links)
- Quantifying matrix product state (Q1746859) (← links)
- Efficient determinization of visibly and height-deterministic pushdown automata (Q1749148) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- On the decidability of subtyping with bounded existential types and implementation constraints (Q1758661) (← links)
- Complementing unary nondeterministic automata (Q1763723) (← links)
- Patterns in words and languages (Q1765231) (← links)
- Finite automata and pattern avoidance in words (Q1775550) (← links)
- A language measure for performance evaluation of discrete-event supervisory control systems (Q1776697) (← links)
- The structure of reflexive regular splicing languages via Schützenberger constants (Q1779297) (← links)
- On membrane hierarchy in P systems (Q1779299) (← links)
- On properties of bond-free DNA languages (Q1779300) (← links)
- Visibly linear dynamic logic (Q1786616) (← links)
- Limit cycle analysis in a class of hybrid systems (Q1792923) (← links)
- A non-ambiguous decomposition of regular languages and factorizing codes (Q1861571) (← links)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
- Path resolution for nested recursive modules (Q1929336) (← links)
- Isomorphism between two BL-general fuzzy automata (Q1933777) (← links)
- Implementation relations and test generation for systems with distributed interfaces (Q1938358) (← links)
- Partition refinement of component interaction automata (Q1951613) (← links)
