Conjunctive Grammars and Systems of Language Equations
Programming and Computing Software
On the closure properties of linear conjunctive languages
Theoretical Computer Science
The hardest linear conjunctive language
Information Processing Letters
A recognition and parsing algorithm for arbitrary conjunctive grammars
Theoretical Computer Science
Parsing expression grammars: a recognition-based syntactic foundation
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the number of nonterminals in linear conjunctive grammars
Theoretical Computer Science
Information and Computation
On state-alternating context-free grammars
Theoretical Computer Science
State complexity of linear conjunctive languages
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Theoretical Computer Science - Mathematical foundations of computer science 2004
Unresolved systems of language equations: expressive power and decision problems
Theoretical Computer Science
Expressiveness and complexity of graph logic
Information and Computation
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Alternating two-way AC-tree automata
Information and Computation
Locally stratified Boolean grammars
Information and Computation
Information and Computation
Conjunctive Grammars and Alternating Pushdown Automata
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
On the Computational Completeness of Equations over Sets of Natural Numbers
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On Alternating Phrase-Structure Grammars
Language and Automata Theory and Applications
Conjunctive Grammars with Restricted Disjunction
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Well-founded semantics for Boolean grammars
Information and Computation
One-Nonterminal Conjunctive Grammars over a Unary Alphabet
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Homomorphisms preserving linear conjunctive languages
Journal of Automata, Languages and Combinatorics
A note on contextual binary feature grammars
CLAGI '09 Proceedings of the EACL 2009 Workshop on Computational Linguistic Aspects of Grammatical Inference
Information and Computation
Complex Algebras of Arithmetic
Fundamenta Informaticae
Automaton representation of linear conjunctive languages
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Efficient automaton-based recognition for linear conjunctive languages
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Whale calf, a parser generator for conjunctive grammars
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Decision problems for language equations with Boolean operations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Decision problems for language equations
Journal of Computer and System Sciences
What do we know about language equations?
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Conjunctive grammars can generate non-regular unary languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
A simple P-complete problem and its representations by language equations
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Conjunctive grammars with restricted disjunction
Theoretical Computer Science
On language equations XXK = XXL and XM = N over a unary alphabet
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Fast parsing for Boolean grammars: a generalization of Valiant's algorithm
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Least and greatest solutions of equations over sets of integers
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
A simple P-complete problem and its language-theoretic representations
Theoretical Computer Science
Towards general algorithms for grammatical inference
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Univariate Equations Over Sets of Natural Numbers
Fundamenta Informaticae
A game-theoretic characterization of Boolean grammars
Theoretical Computer Science
Comparing linear conjunctive languages to subfamilies of the context-free languages
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Using Contextual Representations to Efficiently Learn Context-Free Languages
The Journal of Machine Learning Research
Linear conjunctive grammars and one-turn synchronized alternating pushdown automata
FG'09 Proceedings of the 14th international conference on Formal grammar
A learnable representation for syntax using residuated lattices
FG'09 Proceedings of the 14th international conference on Formal grammar
LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Models of pushdown automata with reset
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Formal language constrained reachability and model checking propositional dynamic logics
RP'11 Proceedings of the 5th international conference on Reachability problems
Language equations with complementation: Expressive power
Theoretical Computer Science
LR parsing for boolean grammars
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
On the expressive power of univariate equations over sets of natural numbers
Information and Computation
On computational universality in language equations
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
A polynomial time extension of parallel multiple context-free grammar
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Three learnable models for the description of language
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Well-Founded semantics for boolean grammars
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Defining contexts in context-free grammars
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Logical grammars, logical theories
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
A Perfect Model for Bounded Verification
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the number of nonterminal symbols in unambiguous conjunctive grammars
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Parsing Boolean grammars over a one-letter alphabet using online convolution
Theoretical Computer Science
Complex Algebras of Arithmetic
Fundamenta Informaticae
Polynomial time learning of some multiple context-free languages with a minimally adequate teacher
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Equations x+a=b and (x+x)+c=(x−x)+d over sets of natural numbers
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Expressive power of LL(k) Boolean grammars
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Conjunctive grammars over a unary alphabet: undecidability and unbounded growth
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Parsing by matrix multiplication generalized to Boolean grammars
Theoretical Computer Science
Finding the smallest binarization of a CFG is NP-hard
Journal of Computer and System Sciences
| Hi-index | 0.01 |