scientific article
From MaRDI portal
Publication:3992695
zbMath0678.68001MaRDI QIDQ3992695
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (10)
Matching regular expressions on uncertain data ⋮ Small universal register machines ⋮ Leveraging environmental correlations: the thermodynamics of requisite variety ⋮ An infrastructure for agent-based systems: An interagent approach ⋮ Structure and randomness of continuous-time, discrete-event processes ⋮ Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer ⋮ Regular languages with variables on graphs ⋮ On the Formalization of Some Results of Context-Free Language Theory ⋮ The calculi of emergence: Computation, dynamics and induction ⋮ On the computation of entropy prior complexity and marginal prior distribution for the Bernoulli model
This page was built for publication:
