Some properties of iterated languages
From MaRDI portal
Publication:2011823
DOI10.1007/S10849-016-9239-6zbMATH Open1396.03083OpenAlexW2333983561MaRDI QIDQ2011823FDOQ2011823
Authors: Sh. Steinert-Threlkeld
Publication date: 7 August 2017
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10849-016-9239-6
Recommendations
Formal languages and automata (68Q45) Logic with extra quantifiers and operators (03C80) Automata and formal grammars in connection with logical questions (03D05)
Cites Work
- Title not available (Why is that?)
- Essays in logical semantics
- The state complexities of some basic operations on regular languages
- Title not available (Why is that?)
- Generalized quantifiers and natural language
- On a generalization of quantifiers
- Title not available (Why is that?)
- A new stable hybrid three-dimensional generalized finite difference time domain algorithm for analyzing complex structures
- \(L(A)=L(B)\)? decidability results from complete formal systems
- State complexity of combined operations with two basic operations
- First-order definable languages
- Polyadic quantifiers
- \(L(A)=L(B)\)? A simplified decidability proof.
- Beyond the frege boundary
- The equivalence problem for deterministic pushdown automata is decidable
- Further beyond the Frege boundary
- Computational Semantics for Monadic Quantifiers
Cited In (7)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Iteration Theorem for Simple Precedence Languages
- Iterated TGR Languages: Membership Problem and Effective Closure Properties
- Some properties of precedence languages
- Title not available (Why is that?)
- Cyclic languages and strongly cyclic languages
This page was built for publication: Some properties of iterated languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011823)