Titlebook: Descriptional Complexity of Formal Systems; 14th International W Martin Kutrib,Nelma Moreira,Rogério Reis Conference proceedings 2012 Sprin

diskitis

OMIT

EXCEL

Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata009, Balan claimed that also the converse holds. Here we show that Balan’s proof of this claim is not correct. Accordingly it is still open whether .-head pushdown automata and centralized PC systems of pushdown automata of degree . working in returning mode accept the same class of languages.

表皮

TAIN

Fifty Years of Women in MathematicsWe study the descriptional cost of converting . into equivalent deterministic devices. We show a double-exponential upper bound for this conversion, together with a super-exponential lower bound.

哥哥喷涌而出

Groups and Automata: A Perfect MatchWe present a personal perspective, inspired by our own research experience, of the interaction between group theory and automata theory: from Benois’ Theorem to Stallings’ automata, from hyperbolic to automatic groups, not forgetting the exotic automaton groups.

LAST

Removing Nondeterminism in Constant Height Pushdown AutomataWe study the descriptional cost of converting . into equivalent deterministic devices. We show a double-exponential upper bound for this conversion, together with a super-exponential lower bound.

ANTH

https://doi.org/10.1007/978-3-642-31623-4context-free languages; contextual grammars; nondeterminism; pushdown automata; state complexity

教育学

BRAVE

Fifty Years of Cytochrome P450 Researchly a finite coalgebraic representation of a regular closed .-coterm. One can give an operational semantics based on capsules for a higher-order programming language with functional and imperative features, including mutable bindings. Static (lexical) scoping is captured purely algebraically without