scientific article
From MaRDI portal
Publication:3108337
zbMath1230.68010MaRDI QIDQ3108337
Publication date: 2 January 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45)
Related Items (19)
Automata and finite order elements in the Nottingham group ⋮ A theoretical framework for cardinality-based feature models: the semantics and computational aspects ⋮ The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete ⋮ \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata ⋮ Smaller representation of compiled regular expressions ⋮ Varieties of agents in agent-based computational economics: a historical and an interdisciplinary perspective ⋮ State complexity of basic language operations combined with reversal ⋮ Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks ⋮ Discovering Block-Structured Process Models from Incomplete Event Logs ⋮ Linear Parsing Expression Grammars ⋮ Detecting Useless Transitions in Pushdown Automata ⋮ Interactive construction of small grammars ⋮ Unnamed Item ⋮ Type inference and strong static type checking for Promela ⋮ Document Spanners ⋮ Undecidability of the speed positiveness problem in reversible and complete Turing machines ⋮ A Weighted Pair Graph Representation for Reconstructibility of Boolean Control Networks ⋮ Palindromic Characteristic of Committed Graphs and Some Model Theoretic Properties ⋮ From finite automata to fractal automata -- the power of recursion
This page was built for publication:
