Recent advances in formal languages and applications.

zbMath1116.68044MaRDI QIDQ2492162

No author found.

Publication date: 8 June 2006

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Related Items (36)

Regulated variants of limited context restarting automata ⋮ Descriptional Complexity of Semi-simple Splicing Systems ⋮ The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages ⋮ Deciding whether a regular language is generated by a splicing system ⋮ Restarting automata with restricted utilization of auxiliary symbols ⋮ Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata ⋮ Digital Image Compression ⋮ Jumping Finite Automata: Characterizations and Complexity ⋮ Unnamed Item ⋮ Investigations on the power of matrix insertion-deletion systems with small sizes ⋮ Parallel communicating grammar systems with regular control and skeleton preserving FRR automata ⋮ Remarks on the Reachability Graphs of Petri Nets ⋮ A Measure for the Degree of Nondeterminism of Context-Free Languages ⋮ Unnamed Item ⋮ Descriptional Complexity of Semi-Simple Splicing Systems ⋮ Non-returning deterministic and nondeterministic finite automata with translucent letters ⋮ State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters ⋮ On CD-systems of stateless deterministic R-automata with window size one ⋮ Algebraic Methods in Quantum Informatics ⋮ Unnamed Item ⋮ Reachability determination in acyclic Petri nets by cell enumeration approach ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata ⋮ On the expressive power of stateless ordered restart-delete automata ⋮ Succinct description of regular languages by weak restarting automata ⋮ On determinism versus nondeterminism for restarting automata ⋮ A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* ⋮ Languages Accepted by Weighted Restarting Automata* ⋮ On deterministic ordered restart-delete automata ⋮ Reversibility for stateless ordered RRWW-automata ⋮ PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS ⋮ Weighted automata ⋮ Two-dimensional hierarchies of proper languages of lexicalized FRR-automata ⋮ Context-sensitive fusion grammars and fusion grammars with forbidden context are universal ⋮ Characterization and complexity results on jumping finite automata

This page was built for publication: Recent advances in formal languages and applications.